709 search results - page 55 / 142 » On LR(k)-Parsers of Polynomial Size |
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
EUROCRYPT
1999
Springer
15 years 2 months ago
1999
Springer
Abstract. This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toepli...
COCO
1998
Springer
15 years 2 months ago
1998
Springer
We consider the resource bounded measure of polynomial-time learnable subclasses of polynomial-size circuits. We show that if EXP 6= MA, then every PAClearnable subclass of P=poly...
EPIA
1993
Springer
15 years 2 months ago
1993
Springer
Abstract. This work presents a constraint solver for the domain of rational trees. Since the problem is NP-hard the strategy used by the solver is to reduce as much as possible, in...
COMPGEOM
1989
ACM
15 years 2 months ago
1989
ACM
We present algorithms that decompose an algebraic curve with rational coefficients in its defining bivariate equation into its irreducible real factors and its non-empty irreducib...