✦ LIBER ✦

Equivalence in the complexity of several problems

✍ Scribed by E. A. Ivanov

Publisher: Springer US
Year: 1984
Tongue: English
Weight: 422 KB
Volume: 19
Category: Article
ISSN: 1573-8337
DOI: 10.1007/bf01068564

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The communication complexity of several

The communication complexity of several problems in matrix computation

✍ Jeff I Chu; Georg Schnitger 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 747 KB

The communication complexity of a function f measures the communication resources required for computingf. In the design of VLSI systems, where savings on the chip area and computation time are desired, this complexity dictates an area x time\* lower bound. We investigate the communication complexit

The problem of equivalence in the class

The problem of equivalence in the class of φ-complexes

✍ V. I. Malinovskii 📂 Article 📅 1972 🏛 Springer US 🌐 English ⚖ 647 KB

Computation complexity of the range of a

Computation complexity of the range of a polynomial in several variables

✍ A. A. Gaganov 📂 Article 📅 1986 🏛 Springer US 🌐 English ⚖ 268 KB

The Complexity of Counting Problems in E

The Complexity of Counting Problems in Equational Matching

✍ Miki Hermann; Phokion G. Kolaitis 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 805 KB

The complexity of domination problems in

The complexity of domination problems in circle graphs

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

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