709 search results - page 66 / 142 » On LR(k)-Parsers of Polynomial Size |
4OR
2010
14 years 10 months ago
2010
This survey is concerned with the size of perfect formulations for combinatorial optimization problems. By "perfect formulation", we mean a system of linear inequalities...
TCC
2007
Springer
15 years 4 months ago
2007
Springer
Abstract. We present a public-key encryption scheme with the following properties. Given a branching program P and an encryption c of an input x, it is possible to efficiently com...
SODA
2012
ACM
13 years 10 days ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
KI
2007
Springer
15 years 4 months ago
2007
Springer
Axiom pinpointing has been introduced in description logics (DLs) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base t...
STOC
1997
ACM
15 years 2 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...