𝔖 Bobbio Scriptorium

✦ LIBER ✦

[IEEE Comput. Soc Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity. (Formerly: Structure in Complexity Theory Conference) - Atlanta, GA, USA (4-6 May 1999)] Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) - Upper semilattice of binary strings with the relation "x is simple conditional to y"

✍ Scribed by Muchnik, A.; Romashchenko, A.; Shen, A.; Vereshchagin, N.

Book ID: 126716293
Publisher: IEEE Comput. Soc
Year: 1999
Weight: 200 KB
Category: Article
ISBN-13: 9780769500751
DOI: 10.1109/CCC.1999.766270

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[IEEE Comput. Soc Proceedings. Fourteent

[IEEE Comput. Soc Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity. (Formerly: Structure in Complexity Theory Conference) - Atlanta, GA, USA (4-6 May 1999)] Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) - On monotone planar circuits

✍ Barrington, D.A.M.; Chi-Jen Lu, ; Miltersen, P.B.; Skyum, S. 📂 Article 📅 1999 🏛 IEEE Comput. Soc ⚖ 124 KB

[IEEE Comput. Soc Proceedings. Fourteent

[IEEE Comput. Soc Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity. (Formerly: Structure in Complexity Theory Conference) - Atlanta, GA, USA (4-6 May 1999)] Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) - Gaps in bounded query hierarchies

✍ Beigel, R. 📂 Article 📅 1999 🏛 IEEE Comput. Soc ⚖ 255 KB

[IEEE Comput. Soc Proceedings. Fourteent

[IEEE Comput. Soc Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity. (Formerly: Structure in Complexity Theory Conference) - Atlanta, GA, USA (4-6 May 1999)] Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317) - Short proofs are narrow-resolution made simple

✍ Ben-Sasson, E.; Wigderson, A. 📂 Article 📅 1999 🏛 IEEE Comput. Soc ⚖ 26 KB

[IEEE Comput. Soc Thirteenth Annual IEEE

[IEEE Comput. Soc Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) - Buffalo, NY, USA (15-18 June 1998)] Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) - Models of computation in coding theory

✍ Spielman, D.A. 📂 Article 📅 1998 🏛 IEEE Comput. Soc 🌐 English ⚖ 73 KB

[IEEE Comput. Soc Thirteenth Annual IEEE

[IEEE Comput. Soc Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) - Buffalo, NY, USA (15-18 June 1998)] Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247) - The satisfiability problem for probabilistic ordered branching programs

✍ Agrawal, M.; Thierauf, T. 📂 Article 📅 1998 🏛 IEEE Comput. Soc 🌐 English ⚖ 186 KB