1225 search results - page 77 / 245 » The Instance Complexity Conjecture |
FOCS
1999
IEEE
14 years 1 months ago
1999
IEEE
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
KGC
1993
Springer
14 years 1 months ago
1993
Springer
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
SODA
2004
ACM
13 years 10 months ago
2004
ACM
Graph H is a root of graph G if there exists a positive integer k such that x and y are adjacent in G if and only if their distance in H is at most k. Motwani and Sudan [1994] prov...
WSC
2004
13 years 10 months ago
2004
Simulation composability is a difficult capability to achieve due to the challenges of creating components, selecting combinations of components, and integrating the selected comp...
EOR
2006
13 years 9 months ago
2006
The success of a company increasingly depends on timely information (internal or external) being available to the right person at the right time for crucial managerial decision-ma...