| 2007 |
|---|
| 5 | EE | Pascal Michel:
Computational complexity of logical theories of one successor and another unary function.
Arch. Math. Log. 46(2): 123-148 (2007) |
| 2004 |
|---|
| 4 | EE | Pascal Michel:
Small Turing machines and generalized busy beaver competition.
Theor. Comput. Sci. 326(1-3): 45-56 (2004) |
| 1992 |
|---|
| 3 | | Pascal Michel:
A Survey of Space Complexity.
Theor. Comput. Sci. 101(1): 99-132 (1992) |
| 2 | | Pascal Michel:
Complexity of Logical Theories Involving Coprimality.
Theor. Comput. Sci. 106(2): 221-241 (1992) |
| 1991 |
|---|
| 1 | | Pascal Michel:
An NP-Complete Language Accepted in Linear Time by a One-Tape Turing Machine.
Theor. Comput. Sci. 85(1): 205-212 (1991) |
