𝔖 Bobbio Scriptorium

✦ LIBER ✦

Some connections between bounded query classes and non-uniform complexity

✍ Scribed by Amihood Amir; Richard Beigel; William Gasarch

Book ID: 114273389
Publisher: Elsevier Science
Year: 2003
Tongue: English
Weight: 301 KB
Volume: 186
Category: Article
ISSN: 0890-5401
DOI: 10.1016/s0890-5401(03)00091-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower Bounds on the Query Complexity of

Lower Bounds on the Query Complexity of Non-uniform and Adaptive Reductions Showing Hardness Amplification

✍ Sergei Artemenko, Ronen Shaltiel 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 443 KB

[ACM Press the twelfth annual ACM sympos

[ACM Press the twelfth annual ACM symposium - Los Angeles, California, United States (1980.04.28-1980.04.30)] Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80 - Some connections between nonuniform and uniform complexity classes

✍ Karp, Richard M.; Lipton, Richard J. 📂 Article 📅 1980 🏛 ACM Press ⚖ 621 KB

[Lecture Notes in Computer Science] Math

[Lecture Notes in Computer Science] Mathematical Foundations of Computer Science 1984 Volume 176 || Some connections between presentability of complexity classes and the power of formal systems of reasoning

✍ Chytil, M. P.; Koubek, V. 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 German ⚖ 342 KB