ACM SIGACT News
The complexity of matrix rank and feasible systems of linear equations (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Bounded queries, approximations, and the Boolean hierarchy
Information and Computation
Computational Politics: Electoral Systems
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
Exact complexity of exact-four-colorability
Information Processing Letters
Lower bounds and the hardness of counting properties
Theoretical Computer Science
All superlinear inverse schemes are coNP-hard
Theoretical Computer Science - Mathematical foundations of computer science 2004
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Information and Computation
Extending downward collapse from 1-versus-2 queries to j-versus-j + 1 queries
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Satisfiability parsimoniously reduces to the Tantrix™ rotation puzzle problem
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
On the power of unambiguity in alternating machines
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Satisfiability Parsimoniously Reduces to the Tantrix™ Rotation Puzzle Problem
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Autonomous Agents and Multi-Agent Systems
| Hi-index | 0.00 |