Pages that link to "Item:Q3642872"
From MaRDI portal
The following pages link to On the Complexity of Numerical Analysis (Q3642872):
Displaying 39 items.
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\) (Q338831) (← links)
- Interpolation in Valiant's theory (Q451113) (← links)
- Fixed points, Nash equilibria, and the existential theory of the reals (Q519892) (← links)
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\) (Q633624) (← links)
- Tractability conditions for numeric CSPs (Q683751) (← links)
- The complexity of tensor rank (Q722207) (← links)
- Computing equilibria: a computational complexity perspective (Q847807) (← links)
- Exotic quantifiers, complexity classes, and complete problems (Q1022429) (← links)
- Tree compression using string grammars (Q1742370) (← links)
- Evaluation of circuits over nilpotent and polycyclic groups (Q1750355) (← links)
- On the metric-based approximate minimization of Markov chains (Q1785848) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Computational complexity of multi-player evolutionarily stable strategies (Q2117070) (← links)
- Emptiness problems for integer circuits (Q2182324) (← links)
- Analyzing probabilistic pushdown automata (Q2248071) (← links)
- Language equivalence of probabilistic pushdown automata (Q2252520) (← links)
- Efficient algorithms for sparse cyclotomic integer zero testing (Q2268346) (← links)
- Monomials in arithmetic circuits: complete problems in the counting hierarchy (Q2353185) (← links)
- Three-monotone interpolation (Q2354672) (← links)
- The complexity of two problems on arithmetic circuits (Q2465637) (← links)
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant (Q2514144) (← links)
- Algebraic Complexity Classes (Q2821695) (← links)
- Complexity of Equivalence and Learning for Multiplicity Tree Automata (Q2922034) (← links)
- A Note on the Complexity of Comparing Succinctly Represented Integers, with an Application to Maximum Probability Parsing (Q2943574) (← links)
- Minimisation of Multiplicity Tree Automata (Q2949446) (← links)
- On Probabilistic Parallel Programs with Process Creation and Synchronisation (Q3000662) (← links)
- The Complexity of Nash Equilibria in Limit-Average Games (Q3090850) (← links)
- Evaluating Matrix Circuits (Q3196387) (← links)
- The Odds of Staying on Budget (Q3449479) (← links)
- Constraint Satisfaction Problems over Numeric Domains (Q4993596) (← links)
- (Q5090425) (← links)
- On the Complexity of Value Iteration (Q5091264) (← links)
- Polynomial Time Algorithms for Branching Markov Decision Processes and Probabilistic Min(Max) Polynomial Bellman Equations (Q5108256) (← links)
- Probabilistic Automata of Bounded Ambiguity (Q5111632) (← links)
- A THEORY OF COMPLEXITY, CONDITION, AND ROUNDOFF (Q5177339) (← links)
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1 (Q6048002) (← links)
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem (Q6081762) (← links)
- An improved approximation algorithm for the \(k\)-prize-collecting minimum power cover problem (Q6149344) (← links)
- Beyond the Existential Theory of the Reals (Q6489317) (← links)
