scientific article; zbMATH DE number 1332669
From MaRDI portal
Publication:4259990
zbMath0924.68088MaRDI QIDQ4259990
Publication date: 8 September 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Fast exact algorithms using Hadamard product of polynomials, Complexity Bounds of Constant-Space Quantum Computation, Faster combinatorial algorithms for determinant and Pfaffian, Quadratic lower bounds for algebraic branching programs and formulas, Non-commutative Edmonds' problem and matrix semi-invariants, Bounded Treewidth and Space-Efficient Linear Algebra, Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication, Parameterised counting in logspace, The complexity of the characteristic and the minimal polynomial., On the closures of monotone algebraic classes and variants of the determinant, Undirected determinant and its complexity, A simple division-free algorithm for computing determinants, General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems, Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits, Isolation, matching, and counting uniform and nonuniform upper bounds, On arithmetic branching programs, Faster Combinatorial Algorithms for Determinant and Pfaffian, COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA, On the complexity of the permanent in various computational models, The quantum query complexity of the determinant, On the complexity of matrix rank and rigidity, Unnamed Item, Unnamed Item, Unnamed Item, Unnamed Item, Determinant Equivalence Test over Finite Fields and over Q, A quadratic lower bound for algebraic branching programs, Planar Maximum Matching: Towards a Parallel Algorithm, On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits, Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits, Variants of the determinant polynomial and the \textsf{VP}-completeness
