scientific article; zbMATH DE number 6472651
From MaRDI portal
Publication:5501853
Cited in
(18)- The combinatorial approach yields an NC algorithm for computing Pfaffians
- Deterministically isolating a perfect matching in bipartite planar graphs
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Arithmetic circuits: a chasm at depth 3
- Algebraic complexity classes
- Faster geometric algorithms via dynamic determinant computation
- Arithmetic Circuits, Monomial Algebras and Finite Automata
- scientific article; zbMATH DE number 7009617 (Why is no real title available?)
- Determinant: Old algorithms, new insights
- Counting problems for Parikh images
- A unified method for placing problems in polylogarithmic depth
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring
- Determinants vs. algebraic branching programs
- Determinants vs. algebraic branching programs
- Determinantal sieving
- Determinants from homomorphisms
- Approximation of min-max and min-max regret versions of some combinatorial optimization problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501853)
