, Computational Complexity: A Modern Approach, 2009.
On the size of binary decision diagrams representing Boolean functions, Theoretical Computer Science, vol.145, issue.1-2, pp.45-69, 1995. ,
Langages formels, calculabilité et complexité. Vuibert, Paris. Chin-Liang Chang et Richard Char-Tung Lee, Computer Science and Applied Mathematics, 1973. ,
Introduction à la logique, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-00396917
Proof Theory and Automated Deduction, Applied Logic Series, vol.6, p.de, 1997. ,
Introduction to Formal Language Theory, 1978. ,
The Art of Computer Programming, fascicle 0: Introduction to Combinatorial Algorithms and Boolean Functions, vol.4, 2008. ,
fascicle 1: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol.4, 2011. ,
, The Art of Computer Programming, vol.4, 2015.
, Logic and Complexity. Discrete Mathematics and Theoretical Computer Science, 2004.
Satisfiability problems for propositional calculi, vol.13, pp.45-53, 1979. ,
DOI : 10.1007/bf01744287
Computational Complexity, 1993. ,
Complexité algorithmique. Ellipses, 2014. ,
, Parsing Theory, Volume I: Languages and Parsing, Seppo Sippu et Eljas Soisalon-Soininen, 1988.
Branching Programs and Binary Decision Diagrams: Theory and Applications, SIAM Monographs in Discrete Mathematics and Applications, 2000. ,
DOI : 10.1137/1.9780898719789
The Formal Semantics of Programming Languages. Foundations of Computing, 1993. ,