scientific article; zbMATH DE number 2150283
From MaRDI portal
Publication:4662832
zbMath1087.68566MaRDI QIDQ4662832
Publication date: 30 March 2005
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (2)
The Complexity of Propositional Proofs ⋮ A la recherche de la definition de la complexite d'espace pour le calcul des polynomes a la maniere de Valiant
This page was built for publication: