The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Machine models and linear time complexity
ACM SIGACT News
Depth reduction for noncommutative arithmetic circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Modified ranks of tensors and the size of circuits
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
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
A combinatorial algorithm for the determinant
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Computational Discrete Mathematics
The Complexity of the Minimal Polynomial
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
On the Minimal Polynomial of a Matrix
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
The complexity of the characteristic and the minimal polynomial
Theoretical Computer Science - Mathematical foundations of computer science
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Multi-linear formulas for permanent and determinant are of super-polynomial size
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
On the reducibility of sets inside NP to sets with low information content
Journal of Computer and System Sciences
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Characterizing Valiant's algebraic complexity classes
Journal of Complexity
The Orbit Problem Is in the GapL Hierarchy
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Multi-linear formulas for permanent and determinant are of super-polynomial size
Journal of the ACM (JACM)
On the guessing number of shift graphs
Journal of Discrete Algorithms
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The orbit problem is in the GapL hierarchy
Journal of Combinatorial Optimization
Min-rank conjecture for log-depth circuits
Journal of Computer and System Sciences
Computational complexity since 1980
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
Binary Representations of Finite Fields and Their Application to Complexity Theory
Finite Fields and Their Applications
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
On the complexity of matrix rank and rigidity
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
| Hi-index | 0.00 |