✦ LIBER ✦

Characterizing polynomial complexity classes by reducibilities

✍ Scribed by Ronald V. Book; Shouwen Tang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Characterizing parallel hierarchies by r

✍ Jianer Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 649 KB

Separations by Random Oracles and “Almos

✍ Wolfgang Merkle; Yongge Wang 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 295 KB

A polynomial characterization of congrue

✍ R. Bělohlávek; I. Chajda 📂 Article 📅 1997 🏛 Springer 🌐 English ⚖ 149 KB

A characterization of a class of polynom

✍ Manabu Sakai 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 79 KB

Characterizing the complexity of landsca

✍ Jean Paul Metzger; Etienne Muller 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 878 KB

Dimension Characterizations of Complexit

✍ Xiaoyang Gu; Jack H. Lutz 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 468 KB