40 search results - page 7 / 8 » Exponential Lower Bounds for the Running Time of DPLL Algori... |
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We investigate the optimality of (1+ )-approximation algorithms obtained via the dimensionality reduction method. We show that: • Any data structure for the (1 + )-approximate n...
CORR
2009
Springer
13 years 4 months ago
2009
Springer
The minimal deterministic finite automaton is generally used to determine regular languages equality. Using Brzozowski's notion of derivative, Antimirov and Mosses proposed a...
DC
2007
2007
Booting clock synchronization in partially synchronous systems with hybrid process and link failures
13 years 6 months ago
This paper provides description and analysis of a new clock synchronization algorithm for synchronous and partially synchronous systems with unknown upper and lower bounds on delay...
IJCGA
2010
13 years 4 months ago
2010
This paper is concerned with on-line problems where a mobile robot of size D has to achieve a task in an unknown planar environment whose geometry is acquired by the robot during ...
STACS
2010
Springer
14 years 1 months ago
2010
Springer
One-counter processes (OCPs) are pushdown processes which operate only on a unary stack alphabet. We study the computational complexity of model checking computation tree logic (CT...