References

1. David A. Barrington, Neil Immerman & Howard Straubing (1990): On uniformity within NC1. Journal of Computer and System Sciences 41(3), pp. 274–306, doi:10.1109/SCT.1988.5262.
2. Vincent Danos (1990): La Logique Linéaire appliquée à létude de divers processus de normalisation (principalement du λ-calcul). These de doctorat, Université Paris VII.
3. Vincent Danos & Laurent Regnier (1989): The structure of multiplicatives. Archive for Mathematical logic 28(3), pp. 181–203, doi:10.1007/BF01622878.
4. Jean-Yves Girard (1996): Proof-nets: The parallel syntax for proof-theory. Logic and Algebra 180, pp. 97–124.
5. William Hesse, Eric Allender & David A. Barrington (2002): Uniform constant-depth threshold circuits for division and iterated multiplication. Journal of Computer and System Sciences 65(4), pp. 695–716, doi:10.1016/S0022-0000(02)00025-9. Available at http://ftp.cs.rutgers.edu/pub/allender/division.pdf.
6. Virgile Mogbil (2009): Non-deterministic Boolean Proof Nets. In: Proceedings of FOPARA'09, Lecture Notes in Computer Science 6324. Springer, pp. 131–145, doi:10.1007/978-3-642-15331-0_9. Available at http://hal.archives-ouvertes.fr/docs/00/44/39/25/PDF/nBPN_preprintLIPN09.pdf.
7. Virgile Mogbil & Vincent Rahli (2007): Uniform circuits, & Boolean proof nets. In: Proceedings of LFCS'07, Lecture Notes in Computer Science 4514. Springer, pp. 401–421, doi:10.1007/978-3-540-72734-7_28. Available at http://hal.archives-ouvertes.fr/docs/00/14/39/28/PDF/mwBN_preprintLIPN07.pdf.
8. Kazushige Terui (2004): Proof Nets and Boolean Circuits. In: Proceedings of LICS'04, pp. 182–191, doi:10.1109/LICS.2004.1319612. Available at http://www.kurims.kyoto-u.ac.jp/~terui/pn.pdf.
9. Heribert Vollmer (1999): Introduction to Circuit Complexity: A Uniform Approach. Springer Verlag.

Comments and questions to: eptcs@eptcs.org

For website issues: webmaster@eptcs.org