On the Complexity of Numerical Analysis
From MaRDI portal
Recommendations
Cited in
(54)- Exotic quantifiers, complexity classes, and complete problems
- Evaluation of circuits over nilpotent and polycyclic groups
- On the metric-based approximate minimization of Markov chains
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem
- Computational complexity of multi-player evolutionarily stable strategies
- Emptiness problems for integer circuits
- Analyzing probabilistic pushdown automata
- Language equivalence of probabilistic pushdown automata
- Efficient algorithms for sparse cyclotomic integer zero testing
- Monomials in arithmetic circuits: complete problems in the counting hierarchy
- Three-monotone interpolation
- The complexity of two problems on arithmetic circuits
- On fixed-polynomial size circuit lower bounds for uniform polynomials in the sense of Valiant
- Algebraic complexity classes
- The Legacy of Turing in Numerical Analysis
- Complexity of equivalence and learning for multiplicity tree automata
- A note on the complexity of comparing succinctly represented integers, with an application to maximum probability parsing
- On probabilistic parallel programs with process creation and synchronisation
- The Complexity of Nash Equilibria in Limit-Average Games
- Evaluating matrix circuits
- Computing discrete logarithms using \(\mathcal{O}((\log q)^2)\) operations from \(\{+,-,\times,\div,\&\}\)
- The odds of staying on budget
- On Faster Integer Calculations Using Non-arithmetic Primitives
- Decision Problems for Nash Equilibria in Stochastic Games
- Interpolation in Valiant's theory
- Computational benefit of smoothness: parameterized bit-complexity of numerical operators on analytic functions and Gevrey's hierarchy
- Constraint satisfaction problems over numeric domains
- scientific article; zbMATH DE number 7453188 (Why is no real title available?)
- On the complexity of symmetric polynomials
- On the Complexity of Value Iteration
- Polynomial time algorithms for branching Markov decision processes and probabilistic min(max) polynomial Bellman equations
- Probabilistic automata of bounded ambiguity
- A theory of complexity, condition, and roundoff
- Fixed points, Nash equilibria, and the existential theory of the reals
- A polynomial time algorithm for computing extinction probabilities of multitype branching processes
- Efficient analysis of probabilistic programs with an unbounded counter
- On the complexity of algebraic numbers, and the bit-complexity of straight-line programs1
- Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph Isomorphism Problem
- On the Order of Power Series and the Sum of Square Roots Problem
- An improved approximation algorithm for the k-prize-collecting minimum power cover problem
- Optimizing \(n\)-variate \((n+k)\)-nomials for small \(k\)
- Beyond the Existential Theory of the Reals
- On classifying continuous constraint satisfaction problems
- The complexity of gradient descent: CLS = PPAD pls
- Reachability in fixed VASS: expressiveness and lower bounds
- Identity testing for radical expressions
- Cyclotomic identity testing and applications
- Tractability conditions for numeric CSPs
- A primal-dual extension of the Goemans-Williamson algorithm for the weighted fractional cut-covering problem
- An improved bound on sums of square roots via the subspace theorem
- The complexity of tensor rank
- Strong approximate consensus halving and the Borsuk-Ulam theorem
- PosSLP and sum of squares
- Computing equilibria: a computational complexity perspective
This page was built for publication: On the Complexity of Numerical Analysis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3642872)
