✦ LIBER ✦

On the Exact Complexity of Evaluating Quantifiedk-CNF

✍ Scribed by Chris Calabro, Russell Impagliazzo, Ramamohan Paturi

Book ID: 120909987
Publisher: Springer
Year: 2012
Tongue: English
Weight: 431 KB
Volume: 65
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-012-9648-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of equational problems

On the complexity of equational problems in CNF

✍ Reinhard Pichler 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 453 KB

Equational problems (i.e. first-order formulae with quantifier prefix ∃ \* ∀ \* , whose only predicate symbol is syntactic equality) are an important tool in many areas of automated deduction, e.g. restricting the set of ground instances of a clause via equational constraints allows the definition o

On the CNF-complexity of bipartite graph

On the CNF-complexity of bipartite graphs containing no squares

✍ Nets Hawk Katz 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 94 KB

Exact complexity of the logistic map

✍ W. -H. Steeb; R. Stoop 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 258 KB

On the Exact Maximum Complexity of Minko

On the Exact Maximum Complexity of Minkowski Sums of Polytopes

✍ Efi Fogel; Dan Halperin; Christophe Weibel 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 608 KB

The complexity of evaluating relational

The complexity of evaluating relational queries

✍ Stavros S. Cosmadakis 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 568 KB

The complexity of evaluating interpolati

The complexity of evaluating interpolation polynomials

✍ H.-J. Stoss 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 196 KB