✦ LIBER ✦

Deciding co-observability is PSPACE-complete

✍ Scribed by Rohloff, K.; Tae-Sic Yoo; Lafortune, S.

Book ID: 118223756
Publisher: IEEE
Year: 2003
Tongue: English
Weight: 299 KB
Volume: 48
Category: Article
ISSN: 0018-9286
DOI: 10.1109/tac.2003.819285

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Integer Circuit Evaluation Is PSPACE-Com

Integer Circuit Evaluation Is PSPACE-Complete

✍ Ke Yang 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 208 KB

Optimizing the Region Algebra is PSPACE-

Optimizing the Region Algebra is PSPACE-complete

✍ Wouter Gelade; Frank Neven 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Decidability, undecidability, and PSPACE

Decidability, undecidability, and PSPACE-completeness of the twins property in the tropical semiring

✍ Daniel Kirsten 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 250 KB

The Othello game on an n × n board is PS

The Othello game on an n × n board is PSPACE-complete

✍ Shigeki Iwata; Takumi Kasai 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 647 KB

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

The consequence relation in the logic of

The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete

✍ Simone Bova; Franco Montagna 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 978 KB