✦ LIBER ✦

On the Expressive Power of OKFDDs

✍ Scribed by Bernd Becker; Rolf Drechsler; Michael Theobald

Book ID: 110264451
Publisher: Springer
Year: 1997
Tongue: English
Weight: 369 KB
Volume: 11
Category: Article
ISSN: 0925-9856
DOI: 10.1023/a:1008635324476

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the expressive power of CSP refinemen

On the expressive power of CSP refinement

✍ A.W. Roscoe 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 208 KB

On the expressive power of data dependen

On the expressive power of data dependencies

✍ Johann A. Makowsky; Moshe Y. Vardi 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 830 KB

On the Expressive Power of Joint Input

✍ Uwe Nestmann 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 549 KB

Expressive power of SQL

✍ Leonid Libkin 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 254 KB

It is a folk result in database theory that SQL cannot express recursive queries such as reachability; in fact, a new construct was added to SQL3 to overcome this limitation. However, the evidence for this claim is usually given in the form of a reference to a proof that relational algebra cannot ex

On the expressive power of F-logic langu

On the expressive power of F-logic language

✍ Zengping Tian; Yujun Wang; Yunyao Qu; Baile Shi 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 606 KB

The expressive power of voting polynomia

The expressive power of voting polynomials

✍ J. Aspnes; R. Beigel; M. Furst; S. Rudich 📂 Article 📅 1994 🏛 Springer-Verlag 🌐 English ⚖ 805 KB