The following pages link to (Q4259990):
Displaying 30 items.
- General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- Faster combinatorial algorithms for determinant and Pfaffian (Q848938) (← links)
- The quantum query complexity of the determinant (Q976107) (← links)
- The complexity of the characteristic and the minimal polynomial. (Q1401240) (← links)
- On \(\text{TC}^0,\text{AC}^0\), and arithmetic circuits (Q1567407) (← links)
- A simple division-free algorithm for computing determinants (Q1944204) (← links)
- Isolation, matching, and counting uniform and nonuniform upper bounds (Q1961370) (← links)
- On arithmetic branching programs (Q1961372) (← links)
- On the complexity of the permanent in various computational models (Q2013543) (← links)
- Variants of the determinant polynomial and the \textsf{VP}-completeness (Q2117074) (← links)
- Quadratic lower bounds for algebraic branching programs and formulas (Q2159469) (← links)
- Unbalancing sets and an almost quadratic lower bound for syntactically multilinear arithmetic circuits (Q2204092) (← links)
- On the complexity of matrix rank and rigidity (Q2268340) (← links)
- Non-commutative Edmonds' problem and matrix semi-invariants (Q2410690) (← links)
- Bounded Treewidth and Space-Efficient Linear Algebra (Q2948475) (← links)
- Lower Bounds for Depth-4 Formulas Computing Iterated Matrix Multiplication (Q2949210) (← links)
- Complexity Bounds of Constant-Space Quantum Computation (Q3451121) (← links)
- (Q4568108) (← links)
- (Q5089246) (← links)
- (Q5090955) (← links)
- Planar Maximum Matching: Towards a Parallel Algorithm (Q5091011) (← links)
- Determinant Equivalence Test over Finite Fields and over Q (Q5091219) (← links)
- A quadratic lower bound for algebraic branching programs (Q5092449) (← links)
- (Q5121899) (← links)
- COMPUTATION OF A DETERMINANT AND A MATRIX PRODUCT IN CELLULAR AUTOMATA (Q5151295) (← links)
- Hitting-Sets for ROABP and Sum of Set-Multilinear Circuits (Q5254013) (← links)
- Faster Combinatorial Algorithms for Determinant and Pfaffian (Q5387794) (← links)
- Parameterised counting in logspace (Q6093373) (← links)
- Undirected determinant and its complexity (Q6166664) (← links)
