709 search results - page 49 / 142 » On LR(k)-Parsers of Polynomial Size |
129
click to vote
STACS
2007
Springer
15 years 7 months ago
2007
Springer
In this paper, it is shown that the Feedback Vertex Set problem on unweighted, undirected graphs has a kernel of cubic size. I.e., a polynomial time algorithm is described, that, w...
141
click to vote
SCOPES
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Synthesis of digital signal processing (DSP) software from dataflow-based formal models is an effective approach for tackling the complexity of modern DSP applications. I...
143
click to vote
CPM
1995
Springer
15 years 5 months ago
1995
Springer
We consider strings which are succinctly described. The description is in terms of straight-line programs in which the constants are symbols and the only operation is the concaten...
109
click to vote
IJAC
2007
15 years 1 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
116
click to vote
COMPGEOM
2009
ACM
15 years 8 months ago
2009
ACM
We consider the following combinatorial problem: given a set of n objects (for example, disks in the plane, triangles), and an integer L ≥ 1, what is the size of the smallest su...