scientific article; zbMATH DE number 6472651
From MaRDI portal
Publication:5501853
zbMath1321.65072MaRDI QIDQ5501853
Publication date: 14 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (14)
Discovering the Roots: Uniform Closure Results for Algebraic Classes Under Factoring ⋮ Faster geometric algorithms via dynamic determinant computation ⋮ The combinatorial approach yields an NC algorithm for computing Pfaffians ⋮ Determinant: Old algorithms, new insights ⋮ Arithmetic Circuits, Monomial Algebras and Finite Automata ⋮ Approximation of min-max and min-max regret versions of some combinatorial optimization problems ⋮ Deterministically isolating a perfect matching in bipartite planar graphs ⋮ Faster Combinatorial Algorithms for Determinant and Pfaffian ⋮ Arithmetic Circuits: A Chasm at Depth 3 ⋮ Algebraic Complexity Classes ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Counting problems for parikh images ⋮ Monomials in arithmetic circuits: complete problems in the counting hierarchy
This page was built for publication:
