On computing the determinant in small parallel time using a small number of processors
Information Processing Letters
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
The design and analysis of algorithms
The design and analysis of algorithms
Circuit definitions of nondeterministic complexity classes
SIAM Journal on Computing
Why is Boolean complexity theory difficult?
Poceedings of the London Mathematical Society symposium on Boolean function complexity
Fast parallel calculation of the rank of matrices over a field of arbitrary characteristic
FCT '85 Fundamentals of Computation Theory
Bounded Depth Arithmetic Circuits: Counting and Closure
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
On TC/sup 0/, AC/sup 0/, and Arithmetic Circuits
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
The combinatorial approach yields an NC algorithm for computing Pfaffians
Discrete Applied Mathematics
Faster combinatorial algorithms for determinant and Pfaffian
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
On the hardness of the noncommutative determinant
Proceedings of the forty-second ACM symposium on Theory of computing
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating min-max (regret) versions of some polynomial problems
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |