𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Polynomial vicinity circuits and nonlinear lower bounds

✍ Scribed by Regan, K.W.

Book ID: 126729673
Publisher: IEEE Comput. Soc
Year: 1997
Weight: 868 KB
Category: Article
ISBN-13: 9780818679070
DOI: 10.1109/CCC.1997.612301

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - On operators of higher types

✍ Vollmer, H.; Wagner, K.W. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 895 KB

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Circuit bottom fan-in and computational power

✍ Liming Cai, ; Jianer Chen, ; Hastad, J. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 654 KB

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - The general notion of a dot-operator

✍ Borchert, B.; Silvestri, R. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 766 KB

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Six hypotheses in search of a theorem

✍ Buhrman, H.; Fortnow, L.; Torenvliet, L. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 909 KB

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - A note on the bottleneck counting argument

✍ Simon, J.; Shi-Chun Tsai, 📂 Article 📅 1997 🏛 IEEE ⚖ 499 KB

[IEEE Comput. Soc Computational Complexi

[IEEE Comput. Soc Computational Complexity. Twelfth Annual IEEE Conference - Ulm, Germany (24-27 June 1997)] Proceedings of Computational Complexity. Twelfth Annual IEEE Conference - Nondeterministic polynomial time versus nondeterministic logarithmic space: time-space tradeoffs for satisfiability

✍ Fortnow, L. 📂 Article 📅 1997 🏛 IEEE Comput. Soc ⚖ 758 KB