scientific article; zbMATH DE number 1332669
From MaRDI portal
Publication:4259990
Recommendations
Cited in
(52)- Verifying the determinant in parallel
- The complexity of the characteristic and the minimal polynomial.
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits
- On the complexity of computing determinants
- A simple division-free algorithm for computing determinants
- Isolation, matching, and counting uniform and nonuniform upper bounds
- On arithmetic branching programs
- On the complexity of the permanent in various computational models
- Variants of the determinant polynomial and the \textsf{VP}-completeness
- Quadratic lower bounds for algebraic branching programs and formulas
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits
- On the complexity of matrix rank and rigidity
- Non-commutative Edmonds' problem and matrix semi-invariants
- Berkowitz's algorithm and clow sequences
- Cancellation is exponentially powerful for computing the determinant
- Bounded treewidth and space-efficient linear algebra
- Lower bounds for depth-4 formulas computing iterated matrix multiplication
- Computation of principal \({\mathcal A}\)-determinants through dimer dynamics
- Complexity bounds of constant-space quantum computation
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems
- scientific article; zbMATH DE number 1555922 (Why is no real title available?)
- scientific article; zbMATH DE number 1775055 (Why is no real title available?)
- A deterministic PTAS for the commutative rank of matrix spaces
- Determinant: Old Algorithms, New Insights
- Computing the Degree of Determinants via Combinatorial Relaxation
- Algorithms of computing determinants in commutative rings
- Determinant: Old algorithms, new insights
- scientific article; zbMATH DE number 7559443 (Why is no real title available?)
- Shortest k-disjoint paths via determinants
- Planar Maximum Matching: Towards a Parallel Algorithm
- Determinant Equivalence Test over Finite Fields and over Q
- A quadratic lower bound for algebraic branching programs
- scientific article; zbMATH DE number 7250151 (Why is no real title available?)
- Computation of a determinant and a matrix product in cellular automata
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits
- scientific article; zbMATH DE number 7070491 (Why is no real title available?)
- Faster Combinatorial Algorithms for Determinant and Pfaffian
- Parameterised counting in logspace
- On the closures of monotone algebraic classes and variants of the determinant
- Undirected determinant and its complexity
- On the closures of monotone algebraic classes and variants of the determinant
- On the power of border width-2 ABPs over fields of characteristic 2
- An enumerative perspective on connectivity
- Parameterised counting in logspace
- Parameterized applications of symbolic differentiation of (totally) multilinear polynomials
- The parallel dynamic complexity of the abelian Cayley group membership problem
- A new characterization of \textsf{VNP} via colored determinant
- Variants of the determinant polynomial and VP-completeness
- On computing the determinant in small parallel time using a small number of processors
- Fast exact algorithms using Hadamard product of polynomials
- Faster combinatorial algorithms for determinant and Pfaffian
- The quantum query complexity of the determinant
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 Q4259990)
