504 search results - page 69 / 101 » The Complexity of Symmetry-Breaking Formulas |
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
We present an AC1 (logDCFL) algorithm for checking LTL formulas over finite paths, thus establishing that the problem can be efficiently parallelized. Our construction provides a f...
PODS
2007
ACM
14 years 10 months ago
2007
ACM
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
CORR
2006
Springer
13 years 10 months ago
2006
Springer
Boolean satisfiability problems are an important benchmark for questions about complexity, algorithms, heuristics and threshold phenomena. Recent work on heuristics, and the satis...
ICCV
1999
IEEE
14 years 12 months ago
1999
IEEE
The necessary and sufficient conditions for being able to estimate scene structure, motion and camera calibration from a sequence of images are very rarely satisfied in practice. ...
ECCV
2000
Springer
14 years 12 months ago
2000
Springer
The quadrifocal tensor which connects image measurements along 4 views is not yet well understood as its counterparts the fundamental matrix and the trifocal tensor. This paper es...