7 search results - page 1 / 2 » Complexity of Propositional Proofs Under a Promise |
ICALP
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. We study – within the framework of propositional proof complexity – the problem of certifying unsatisfiability of CNF formulas under the promise that any satisfiabl...
LATA
2009
Springer
13 years 11 months ago
2009
Springer
Abstract. Motivated by strong Karp-Lipton collapse results in bounded arithmetic, Cook and Kraj´ıˇcek [7] have recently introduced the notion of propositional proof systems with...
COCO
2003
Springer
13 years 10 months ago
2003
Springer
We study the question of whether the class DisjNP of disjoint pairs (A, B) of NP-sets contains a complete pair. The question relates to the question of whether optimal proof system...
IJCAI
2007
13 years 6 months ago
2007
Temporal reasoning is widely used within both Computer Science and A.I. However, the underlying complexity of temporal proof in discrete temporal logics has led to the use of simp...
MOBIHOC
2008
ACM
14 years 4 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...