✦ LIBER ✦

The Real Dimension Problem Is NPR-Complete

✍ Scribed by Pascal Koiran

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 123 KB
Volume: 15
Category: Article
ISSN: 0885-064X
DOI: 10.1006/jcom.1999.0502

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The STO problem is NP-complete

✍ P. Krysta; L. Pacholski 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 233 KB

We prove that the problem STO of deciding whether or not a finite set E of term equations is subject to occur-check is in NP. E is subject to occur-check if the execution of the Martelli-Montanari unification algorithm gives for input E a set E ∪ {x = t}, where t = x and x appears in t. Apt et al. (

Deciding the Vapnik–Červonenkis Dimensio

Deciding the Vapnik–Červonenkis Dimension is∑p3-complete

✍ Marcus Schaefer 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 160 KB

N. Linial et al. raised the question of how difficult the computation of the Vapnik C 8 ervonenkis dimension of a concept class over a finite universe is. C. Papadimitriou and M. Yannakakis obtained a first answer using matrix representations of concept classes. However, this approach does not captu