Cook's versus Valiant's hypothesis

On the complexity of diophantine geometry in low dimensions (extended abstract)

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing

On Implications between P-NP-Hypotheses: Decision versus Computation in Algebraic Complexity

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science

Counting complexity classes for numeric computations II: algebraic and semialgebraic sets

Journal of Complexity

Kolmogorov Complexity Theory over the Reals

Electronic Notes in Theoretical Computer Science (ENTCS)

Lower Bounds for the Determinantal Complexity of Explicit Low Degree Polynomials

CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications

Counting complexity classes for numeric computations II: Algebraic and semialgebraic sets

Journal of Complexity

On defining integers in the counting hierarchy and proving arithmetic circuit lower bounds

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science

An Overview of Mathematical Issues Arising in the Geometric Complexity Theory Approach to $\mathbf{VP}\neq\mathbf{VNP}$

SIAM Journal on Computing

Marginal hitting sets imply super-polynomial lower bounds for permanent

Proceedings of the 3rd Innovations in Theoretical Computer Science Conference

Geometric aspects related to solutions of #kSAT

MICAI'05 Proceedings of the 4th Mexican international conference on Advances in Artificial Intelligence

Towards a tight hardness-randomness connection between permanent and arithmetic circuit identity testing

Information Processing Letters