SwePub
Sök i SwePub databas

  Extended search

Träfflista för sökning "WFRF:(Sanyal Swagato) "

Search: WFRF:(Sanyal Swagato)

  • Result 1-1 of 1
Sort/group result
   
EnumerationReferenceCoverFind
1.
  • Mukhopadhyay, Sagnik, et al. (author)
  • Separation Between Deterministic and Randomized Query Complexity
  • 2018
  • In: SIAM journal on computing (Print). - : Siam Publications. - 0097-5397 .- 1095-7111. ; 47:4, s. 1644-1666
  • Journal article (peer-reviewed)abstract
    • Saks and Wigderson 27th FOGS, IEEE Computer Society, as Alamitos, CA, 1986, pp. 29-38] conjectured that R-0(f) = Omega (D(f)(0.753...)) for all Boolean functions f, here R-0 denotes the randomized complexity and D denotes 10 determinist is query CCATI p1exit;,yr. We,show t hat for the pointer function GPW(rxs) defined by Goos. Pitassi, arid Watson [in Proceedings of the 56th FOCS, IEEE, Piscataway, NJ, 2015, pp. 1077-1088] the following hold: s) s) and (b) R-1(GPW(rxs)) = Irs), cyhere R1 denotes the randomized one-sided error query complexity. These results imply that (i) R-0(GPW(s2xs)) = O(D(GPW(s2xs))2/3) t hereby refuting the; conjecture of Saks and Wigdorson, and (ii) R-1 (GPW(sxs))- O(R-0(GPW(sxs))(2/3)), thereby providing a polynomial separation between the randomized zero -error and one-sided error query complexity measures.
  •  
Skapa referenser, mejla, bekava och länka
  • Result 1-1 of 1
Type of publication
journal article (1)
Type of content
peer-reviewed (1)
Author/Editor
Mukhopadhyay, Sagnik (1)
Radhakrishnan, Jayku ... (1)
Sanyal, Swagato (1)
University
Royal Institute of Technology (1)
Language
English (1)
Research subject (UKÄ/SCB)
Natural sciences (1)
Year
2018 (1)

Kungliga biblioteket hanterar dina personuppgifter i enlighet med EU:s dataskyddsförordning (2018), GDPR. Läs mer om hur det funkar här.
Så här hanterar KB dina uppgifter vid användning av denna tjänst.

 
pil uppåt Close

Copy and save the link in order to return to this view