✦ LIBER ✦

On the complexity of diagram testing

✍ Scribed by Graham Brightwell

Publisher: Springer Netherlands
Year: 1993
Tongue: English
Weight: 483 KB
Volume: 10
Category: Article
ISSN: 0167-8094
DOI: 10.1007/bf01108825

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on Voronoi diagram complex

A lower bound on Voronoi diagram complexity

✍ Boris Aronov 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 49 KB

The complexity of determinacy problem on

The complexity of determinacy problem on group testing

✍ Feng Yang; Ding-Zhu Du 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 659 KB

Complexity of tests checking the operati

Complexity of tests checking the operation of logic diagram inputs

✍ V. N. Noskov 📂 Article 📅 1975 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 566 KB

On the complexity of testing the Collect

On the complexity of testing the Collective Axiom of Revealed Preference

✍ Fabrice Talla Nobibon; Frits C.R. Spieksma 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 461 KB

We prove that the problem of testing whether data of consumption expenditures satisfy the Collective Axiom of Revealed Preference (CARP) is an NP-complete problem.

On the complexity of testing for odd hol

On the complexity of testing for odd holes and induced odd paths

✍ Dan Bienstock 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 410 KB

Complexity of diagrams

✍ Jaroslav Nešetřil; Vojtěch Rödl 📂 Article 📅 1987 🏛 Springer Netherlands 🌐 English ⚖ 461 KB