✦ LIBER ✦

Admissible closures of polynomial time computable arithmetic

✍ Scribed by Dieter Probst; Thomas Strahm

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Weak Constructive Second-Order Arithme

✍ A. P. Beltiukov 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 270 KB

Some properties of sets tractable under

✍ Rainer Schuler 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 504 KB

The algebraic structure of the isomorphi

✍ Yongge Wang 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 213 KB

An upper bound on the independence numbe

✍ Carlos J. Luz 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 450 KB

Computing the Conway polynomial of sever

✍ David A. Lizárraga-Navarro; Hugo Cabrera-Ibarra; Leila Y. Hernández-Villegas 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 377 KB

A polynomial-time algorithm for computin

✍ Norihiro Mizuno 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 242 KB