709 search results - page 30 / 142 » On LR(k)-Parsers of Polynomial Size |
107
click to vote
COCOA
2007
Springer
15 years 7 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
STOC
1996
ACM
15 years 5 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
146
click to vote
CC
2008
Springer
15 years 29 days ago
2008
Springer
In their seminal paper, Valiant, Skyum, Berkowitz and Rackoff proved that arithmetic circuits can be balanced [VSBR]. That is, [VSBR] showed that for every arithmetic circuit of ...
127
click to vote
MST
2011
14 years 8 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
113
click to vote
FOCS
2006
IEEE
15 years 5 months ago
2006
IEEE
We consider random 3CNF formulas with n variables and m clauses. It is well known that when m > cn (for a sufficiently large constant c), most formulas are not satisfiable. How...