✦ LIBER ✦

Randomization and the computational power of analytic and algebraic decision trees

✍ Scribed by Dima Grigoriev; Marek Karpinski; Roman Smolensky

Publisher: Springer
Year: 1996
Tongue: English
Weight: 702 KB
Volume: 6
Category: Article
ISSN: 1016-3328
DOI: 10.1007/bf01270388

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalence of Binary and Ternary Algebr

Equivalence of Binary and Ternary Algebraic Decision Trees

✍ R. Beals 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 48 KB

Algebraic and Computational Formulas for

Algebraic and Computational Formulas for the Index of Real Analytic Vector Fields

✍ Víctor Castellanos; Abel Castorena; Manuel Cruz-López 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 218 KB

Reduced sub-powers and the decision prob

Reduced sub-powers and the decision problem for finite algebras in arithmetical varieties

✍ Pawel M. Idziak 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 917 KB

The exchange and allocation of decision

The exchange and allocation of decision power

✍ Tomas Philipson 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 760 KB

The ordering of trees and connected grap

The ordering of trees and connected graphs by algebraic connectivity

✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with α(P n ) < α(Q n ) < α(W n ) < α(Z n ) < α(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L

Rational set of trees and the algebraic

Rational set of trees and the algebraic semantics of logic programming

✍ G. Marque-Pucheu 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 530 KB