Pages that link to "Item:Q3036703"
From MaRDI portal
The following pages link to Fast Parallel Computation of Polynomials Using Few Processors (Q3036703):
Displaying 50 items.
- The arithmetic complexity of tensor contraction (Q290898) (← links)
- Subexponential size hitting sets for bounded depth multilinear formulas (Q301528) (← links)
- A generalization of Spira's theorem and circuits with small segregators or separators (Q342721) (← links)
- Resource trade-offs in syntactically multilinear arithmetic circuits (Q371194) (← links)
- Arithmetic circuits: the chasm at depth four gets wider (Q442109) (← links)
- Lower bounds for tropical circuits and dynamic programs (Q493653) (← links)
- Multilinear formulas, maximal-partition discrepancy and mixed-sources extractors (Q619913) (← links)
- Functional decomposition of polynomials: the tame case (Q753496) (← links)
- On computing the determinant in small parallel time using a small number of processors (Q794429) (← links)
- Size-depth trade-offs for monotone arithmetic circuits (Q804295) (← links)
- Fast exact algorithms using Hadamard product of polynomials (Q832524) (← links)
- A complexity theory of efficient parallel algorithms (Q913512) (← links)
- Lower bounds on monotone arithmetic circuits with restricted depths (Q1070999) (← links)
- Irreducibility of multivariate polynomials (Q1083191) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- On efficient parallel computations for some dynamic programming problems (Q1109691) (← links)
- Feasible arithmetic computations: Valiant's hypothesis (Q1114391) (← links)
- The iterated mod problem (Q1119390) (← links)
- Non-commutative arithmetic circuits: depth reduction and size lower bounds (Q1274913) (← links)
- A quasi-polynomial-time algorithm for sampling words from a context-free language (Q1363787) (← links)
- Lower bounds on arithmetic circuits via partial derivatives (Q1377574) (← links)
- Some complete and intermediate polynomials in algebraic complexity theory (Q1635814) (← links)
- Balancing bounded treewidth circuits (Q1678757) (← links)
- Multi-\(k\)-ic depth three circuit lower bound (Q1694000) (← links)
- Fast and efficient parallel solution of dense linear systems (Q1825589) (← links)
- Cook's versus Valiant's hypothesis (Q1978701) (← links)
- Linear matroid intersection is in quasi-NC (Q2027206) (← links)
- Real \(\tau \)-conjecture for sum-of-squares: a unified approach to lower bound and derandomization (Q2117077) (← links)
- Two dynamic programming algorithms for which interpreted pebbling helps (Q2277375) (← links)
- Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees (Q2323361) (← links)
- Geometric complexity theory: an introduction for geometers (Q2346304) (← links)
- On the efficiency of effective Nullstellensätze (Q2366723) (← links)
- Dual VP classes (Q2410687) (← links)
- Characterizing Valiant's algebraic complexity classes (Q2479314) (← links)
- Improved bounds for reduction to depth 4 and depth 3 (Q2514141) (← links)
- Boolean circuits versus arithmetic circuits (Q2639101) (← links)
- (Q2808529) (← links)
- Arithmetic Circuits: A Chasm at Depth 3 (Q2816300) (← links)
- Jacobian Hits Circuits: Hitting Sets, Lower Bounds for Depth-$D$ Occur-$k$ Formulas and Depth-3 Transcendence Degree-$k$ Circuits (Q2817792) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- A Selection of Lower Bounds for Arithmetic Circuits (Q2821696) (← links)
- Geometric complexity theory V: Efficient algorithms for Noether normalization (Q2826783) (← links)
- $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
- Computing (and Life) Is All about Tradeoffs (Q2848971) (← links)
- A Generalization of Spira’s Theorem and Circuits with Small Segregators or Separators (Q2891374) (← links)
- The Shifted Partial Derivative Complexity of Elementary Symmetric Polynomials (Q2946403) (← links)
- An Exponential Lower Bound for Homogeneous Depth Four Arithmetic Formulas (Q2968156) (← links)
- On the Power of Homogeneous Depth 4 Arithmetic Circuits (Q2968157) (← links)
- Characterizing Arithmetic Circuit Classes by Constraint Satisfaction Problems (Q3012844) (← links)
- Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes (Q3088284) (← links)
