Uniform constant-depth threshold circuits for division and iterated multiplication, J. Comput. System Sci, vol.65, issue.4, pp.695-716, 2001. ,
On the Complexity of Numerical Analysis, SIAM Journal on Computing, vol.38, issue.5, pp.1987-200609, 2008. ,
DOI : 10.1137/070697926
Log Depth Circuits for Division and Related Problems, SIAM Journal on Computing, vol.15, issue.4, pp.994-1003, 1986. ,
DOI : 10.1137/0215070
On the complexity of pattern matching for highly compressed two-dimensional texts, Combinatorial pattern matching, pp.40-51, 1997. ,
DOI : 10.1007/3-540-63220-4_48
Formal properties of XML grammars and languages, Acta Informatica, vol.38, issue.9, pp.649-671, 2002. ,
DOI : 10.1007/s00236-002-0085-4
URL : https://hal.archives-ouvertes.fr/hal-00619461
A characterization of the class of functions computable in polynomial time on Random Access Machines, Proceedings of the thirteenth annual ACM symposium on Theory of computing , STOC '81, pp.168-176, 1981. ,
DOI : 10.1145/800076.802470
The Inclusion Problem of Context-Free Languages: Some Tractable Cases, Developments in language theory, pp.103-112, 2009. ,
DOI : 10.1007/3-540-47849-3_3
Complexity and real computation, 1997. ,
DOI : 10.1007/978-1-4612-0701-6
String-rewriting systems, 1993. ,
The complexity of robot motion planning, volume 1987 of ACM Doctoral Dissertation Awards, 1988. ,
Some algebraic and geometric computations in PSPACE, Proceedings of the twentieth annual ACM symposium on Theory of computing , STOC '88, pp.460-469, 1988. ,
DOI : 10.1145/62212.62257
Probì emes combinatoires de commutation et réarrangements, Lecture Notes in Mathematics, issue.85, 1969. ,
DOI : 10.1007/bfb0079468
Commutations dans les mono¨?desmono¨?des libres: un cadre théorique pour l'´ etude du parallélisme, 1986. ,
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract), 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07), pp.113-123, 2007. ,
DOI : 10.1109/FOCS.2007.39
Some NP-complete geometric problems, Proceedings of the eighth annual ACM symposium on Theory of computing , STOC '76, pp.10-22, 1976. ,
DOI : 10.1145/800113.803626
A guide to the theory of NP-completeness, Series of Books in the Mathematical Sci- ences, 1979. ,
Unification with Singleton Tree Grammars, Rewriting Techniques and Applications, pp.365-379, 2009. ,
DOI : 10.1145/321250.321253
Efficient algorithms for Lempel-Ziv encoding, Lecture Notes in Computer Science, vol.1097, pp.392-403, 1996. ,
DOI : 10.1007/3-540-61422-2_148
Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem, Journal of the ACM, vol.27, issue.4, pp.675-700, 1980. ,
DOI : 10.1145/322217.322224
Uniform constant-depth threshold circuits for division and iterated multiplication, Journal of Computer and System Sciences, vol.65, issue.4, pp.695-716, 2002. ,
DOI : 10.1016/S0022-0000(02)00025-9
On the equivalence and containment problems for context-free languages, Mathematical Systems Theory, vol.113, issue.2, pp.119-124, 1969. ,
DOI : 10.1007/BF01746517
Relational representability, local reductions, and the complexity of generalized satisfiability problems, 2000. ,
A characterization of parenthesis languages, Information and Control, vol.11, issue.3, pp.269-289, 1967. ,
DOI : 10.1016/S0019-9958(67)90564-5
Three approaches to the quantitative definition of information. Internat, J. Comput. Math, vol.2, pp.157-168, 1968. ,
Approximation algorithms for grammar-based compression, SODA '02: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms, pp.205-212, 2002. ,
Processing Compressed Texts: A Tractability Border, Combinatorial Pattern Matching, pp.228-240, 2007. ,
DOI : 10.1007/978-3-540-73437-6_24
Word Problems and Membership Problems on Compressed Words, SIAM Journal on Computing, vol.35, issue.5, pp.1210-1240, 2006. ,
DOI : 10.1137/S0097539704445950
Concurrent Program Schemes and their Interpretations, DAIMI Report Series, vol.6, issue.78, 1977. ,
DOI : 10.7146/dpb.v6i78.7691
The equivalence problem for regular expressions with squaring requires exponential space, 13th Annual Symposium on Switching and Automata Theory (swat 1972), pp.125-129, 1972. ,
DOI : 10.1109/SWAT.1972.29
Non-Cooperative Games, The Annals of Mathematics, vol.54, issue.2, pp.286-295, 1951. ,
DOI : 10.2307/1969529
Testing equivalence of morphisms on context-free languages, Algorithms?ESA '94, pp.460-470, 1994. ,
DOI : 10.1007/BFb0049431
Lower bounds on the size of bounded depth networks over a complete basis with logical addition, Mathematicheskie Zametki, vol.41, issue.4, pp.598-607, 1987. ,
On Threshold Circuits and Polynomial Computation, SIAM Journal on Computing, vol.21, issue.5, pp.896-908, 1992. ,
DOI : 10.1137/0221053
Application of Lempel???Ziv factorization to the approximation of grammar-based compression, Theoretical Computer Science, vol.302, issue.1-3, pp.211-222, 2003. ,
DOI : 10.1016/S0304-3975(02)00777-6
On the power of random access machines, Proceedings of the 6th Colloquium, on Automata, Languages and Programming, pp.520-529, 1979. ,
DOI : 10.1007/3-540-09510-1_42
A problem that is easier to solve on the unit-cost algebraic RAM, Journal of Complexity, vol.8, issue.4, pp.393-397, 1992. ,
DOI : 10.1016/0885-064X(92)90003-T
Complexity classes defined by counting quantifiers, Journal of the ACM, vol.38, issue.3, pp.753-774, 1991. ,
DOI : 10.1145/116825.116858
Decision procedures for families of deterministic pushdown automata, 1973. ,
Theory of Games and Economic Behavior, 1947. ,
The complexity of combinatorial problems with succinct input representation, Acta Informatica, vol.3, issue.3, pp.325-356, 1986. ,
DOI : 10.1007/BF00289117