✦ LIBER ✦

Relational queries computable in polynomial time

✍ Scribed by Neil Immerman

Book ID: 114037774
Publisher: Elsevier Science
Year: 1986
Weight: 859 KB
Volume: 68
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(86)80029-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tutte polynomials computable in polynomi

Tutte polynomials computable in polynomial time

✍ J.G. Oxley; D.J.A. Welsh 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 717 KB

Shortest consistent superstrings computa

Shortest consistent superstrings computable in polynomial time

✍ Tao Jiang; Vadim G. Timkovsky 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Admissible closures of polynomial time c

Admissible closures of polynomial time computable arithmetic

✍ Dieter Probst; Thomas Strahm 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 253 KB

Bounding queries in the analytic polynom

Bounding queries in the analytic polynomial-time hierarchy

✍ Herbert Baier; Klaus W. Wagner 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 1004 KB

In a previous paper the present authors (Baier and Wagner, 1996) investigated an S-V-hierarchy over P using word quantifiers as well as two types of set quantifiers, the so-called analytic polynomial-time hierarchy. The fact that some constructions there result in a bounded number of oracle queries

A polynomial time computable metric betw

A polynomial time computable metric between point sets

✍ Jan Ramon; Maurice Bruynooghe 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 150 KB

Functions computable in polynomial space

✍ Matthias Galota; Heribert Vollmer 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 226 KB