A note on the determinant and permanent problem
Information and Computation
Complexity and real computation
Complexity and real computation
Quantum computers that can be simulated classically in polynomial time
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems
SIAM Journal on Computing
Quantum Circuits That Can Be Simulated Classically in Polynomial Time
SIAM Journal on Computing
Theoretical Computer Science
Completeness classes in algebra
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Holographic Algorithms (Extended Abstract)
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Holographic algorithms: from art to science
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
SIAM Journal on Computing
Basis Collapse in Holographic Algorithms
Computational Complexity
Geometric Complexity Theory II: Towards Explicit Obstructions for Embeddings among Class Varieties
SIAM Journal on Computing
On symmetric signatures in holographic algorithms
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Valiant’s holant theorem and matchgate tensors
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Some results on matchgates and holographic algorithms
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Holographic algorithms: the power of dimensionality resolved
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
| Hi-index | 0.00 |
In this primarily expository article, I describe geometric approaches to variants of P versus NP, present several results that illustrate the role of group actions in complexity theory, and make a first step towards geometric definitions of complexity classes. My goal is to help bring geometry and complexity theory closer together.