2252 search results - page 86 / 451 » Lower Bounds for Dynamic Algorithms |
201
click to vote
COLT
2008
Springer
15 years 8 months ago
2008
Springer
A pseudo-Boolean function is a real-valued function defined on {0, 1}n . A k-bounded function is a pseudo-Boolean function that can be expressed as a sum of subfunctions each of w...
182
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. We consider the problem of encoding a graph with n vertices and m edges compactly supporting adjacency, neighborhood and degree queries in constant time in the log n-bit ...
160
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
In this paper we present an algorithmic framework for solving a class of combinatorial optimization problems on graphs with bounded pathwidth. The problems are NP-hard in general, ...
147
click to vote
ISAAC
2007
Springer
16 years 10 days ago
2007
Springer
This paper shows that it is NP-hard to generate a minimum complete test set for stuck-at faults on the wires of a reversible circuit. We also show non-trivial lower bounds for the ...
163
click to vote
COCO
2004
Springer
15 years 11 months ago
2004
Springer
A source is compressible if we can efficiently compute short descriptions of strings in the support and efficiently recover the strings from the descriptions. A source has high ps...