709 search results - page 1 / 142 » On LR(k)-Parsers of Polynomial Size |
IPL
2006
13 years 10 months ago
2006
Valiant (1979) proved that every polynomial of formula size e is a projection of the (e + 2)
ASIACRYPT
2010
Springer
13 years 9 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...
AAAI
1996
14 years 5 days ago
1996
One of the most widespread approaches to reactive planning is Schoppers' universal plans. We propose a stricter definition of universal plans which guarantees a weak notion o...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
In this paper, we use resource-bounded dimension theory to investigate polynomial size circuits. We show that for every i 0, P/poly has ith-order scaled p3 -strong dimension 0. W...
TLCA
2007
Springer
14 years 5 months ago
2007
Springer
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...