709 search results - page 85 / 142 » On LR(k)-Parsers of Polynomial Size |
DAM
2006
14 years 10 months ago
2006
The maximum intersection problem for a matroid and a greedoid, given by polynomialtime oracles, is shown NP-hard by expressing the satisfiability of boolean formulas in 3-conjunct...
JCSS
2008
14 years 9 months ago
2008
We provide a characterization of the resolution width introduced in the context of propositional proof complexity in terms of the existential pebble game introduced in the context...
CPHYSICS
2007
14 years 9 months ago
2007
We illustrate recent progress in developing algorithms for solving the Kohn-Sham problem. Key ingredients of our algorithm include pseudopotentials implemented on a real space gri...
DAM
2007
14 years 9 months ago
2007
It is shown that the set of hybrid one-dimensional reversible cellular automata (CA) with the periodic boundary condition is a regular set. This has several important consequences...
EOR
2007
14 years 9 months ago
2007
In this note we study the tool switching problem with non-uniform tool sizes. More specifically, we consider the problem where the job sequence is given as part of the input. We ...