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
A characterization of span program size and improved lower bounds for monotone span programs
Computational Complexity
Computing the sign or the value of the determinant of an integer matrix, a complexity survey
Journal of Computational and Applied Mathematics - Special issue: Proceedings of the international conference on linear algebra and arithmetic, Rabat, Morocco, 28-31 May 2001
Span-program-based quantum algorithm for evaluating formulas
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
The Orbit Problem Is in the GapL Hierarchy
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
The polynomially bounded perfect matching problem is in NC2
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Counting classes and the fine structure between NC1and L
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
The orbit problem is in the GapL hierarchy
Journal of Combinatorial Optimization
Counting classes and the fine structure between NC1 and L
Theoretical Computer Science
On the bipartite unique perfect matching problem
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
The complexity of solving linear equations over a finite ring
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Information Processing Letters
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
Monomials, multilinearity and identity testing in simple read-restricted circuits
Theoretical Computer Science
| Hi-index | 0.01 |