4865 search results - page 292 / 973 » The Complexity of Graph Connectivity |
168
click to vote
SAT
2009
Springer
16 years 1 months ago
2009
Springer
Default logic was introduced by Reiter in 1980. In 1992, Gottlob classified the complexity of the extension existence problem for propositional default logic as Σp 2-complete, an...
154
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
The objective of the standard parts optimal control problem is to find a number, m, of control inputs to a given input-output system that can be used in different combinations to...
182
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...
177
click to vote
SOFSEM
2005
Springer
16 years 4 days ago
2005
Springer
Abstract. Treewidth is a graph parameter with several interesting theoretical and practical applications. This survey reviews algorithmic results on determining the treewidth of a ...
164
click to vote
CADE
2009
Springer
16 years 1 months ago
2009
Springer
predicate abstraction Shuvendu K. Lahiri and Shaz Qadeer Microsoft Research In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relati...