709 search results - page 3 / 142 » On LR(k)-Parsers of Polynomial Size |
COCO
2006
Springer
13 years 9 months ago
2006
Springer
We may believe SAT does not have small Boolean circuits. But is it possible that some language with small circuits looks indistiguishable from SAT to every polynomialtime bounded ...
COMPGEOM
1991
ACM
13 years 9 months ago
1991
ACM
We describe methods for triangulating polygonal regions of the plane so that no triangle has a large angle. Our main result is that a polygon with n sides can be triangulated with...
DCC
2010
IEEE
13 years 9 days ago
2010
IEEE
Abstract. Given an algebraic geometry code CL(D, P), the GuruswamiSudan algorithm produces a list of all codewords in CL(D, P) within a specified distance of a received word. The i...
FOCS
2007
IEEE
13 years 11 months ago
2007
IEEE
We construct an explicit polynomial f(x1, . . . , xn), with coefficients in {0, 1}, such that the size of any syntactically multilinear arithmetic circuit computing f is at least ...
EUROCRYPT
2005
Springer
13 years 11 months ago
2005
Springer
We present several attacks on RSA that factor the modulus in polynomial time under the condition that a fraction of the most significant bits or least significant bits of the pri...