Sciweavers

77 search results - page 16 / 16
» On the Sum of Square Roots of Polynomials and related proble...
Sort
View
JCSS
2008
120views more  JCSS 2008»
13 years 5 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
FOCS
2009
IEEE
14 years 22 hour ago
Linear Systems over Composite Moduli
We study solution sets to systems of generalized linear equations of the form ℓi(x1, x2, · · · , xn) ∈ Ai (mod m) where ℓ1, . . . , ℓt are linear forms in n Boolean var...
Arkadev Chattopadhyay, Avi Wigderson