Are lower bounds easier over the reals?
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Calculs sur les structures de langage dénombrable
Theoretical Computer Science
Circuits versus Trees in Algebraic Complexity
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Une tentative malheureuse do construire une structure éliminant rapidement les quanteurs
Proceedings of the 14th Annual Conference of the EACSL on Computer Science Logic
P = NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
P=NP for some structures over the binary words
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Journal of Complexity - Festschrift for the 70th birthday of Arnold Schönhage
Computability over an arbitrary structure: sequential and parallel polynomial time
FOSSACS'03/ETAPS'03 Proceedings of the 6th International conference on Foundations of Software Science and Computation Structures and joint European conference on Theory and practice of software
Hi-index | 0.00 |