3415 search results - page 295 / 683 » Lower bounds on kernelization |
174
click to vote
LATIN
2004
Springer
16 years 2 days ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
180
click to vote
MFCS
2004
Springer
16 years 2 days ago
2004
Springer
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas. These basically consist of the conc...
144
click to vote
SCN
2004
Springer
16 years 2 days ago
2004
Springer
Abstract. Span programs provide a linear algebraic model of computation. Monotone span programs (MSP) correspond to linear secret sharing schemes. This paper studies the properties...
172
Voted
STACS
1994
Springer
15 years 10 months ago
1994
Springer
The L ? = NL question remains one of the major unresolved problems in complexity theory. Both L and NL have logical characterizations as the sets of totally ordered ( ) structures...
205
click to vote
BIRTHDAY
2009
Springer
15 years 10 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...