3415 search results - page 319 / 683 » Lower bounds on kernelization |
156
click to vote
STACS
2000
Springer
15 years 10 months ago
2000
Springer
We clarify the computational complexity of planarity testing, by showing that planarity testing is hard for L, and lies in SL. This nearly settles the question, since it is widely...
202
click to vote
COMPGEOM
1995
ACM
15 years 10 months ago
1995
ACM
We present a simple but powerful new probabilistic technique for analyzing the combinatorial complexity of various substructures in arrangements of piecewise-linear surfaces in hig...
207
click to vote
ISLPED
1997
ACM
15 years 10 months ago
1997
ACM
New measures of peak power in the context of sequential circuits are proposed. This paper presents an automatic procedure to obtain very good lower bounds on these measures as wel...
165
click to vote
AIPS
2008
15 years 9 months ago
2008
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
188
click to vote
COMPGEOM
2008
ACM
15 years 8 months ago
2008
ACM
We study the problem of two-dimensional Delaunay triangulation in the self-improving algorithms model [1]. We assume that the n points of the input each come from an independent, ...