Degrees of second- and higher-order polynomials
From MaRDI portal
Cites work
- A new Characterization of Type-2 Feasibility
- Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
- Complexity for type-2 relations
- Complexity theory for operators in analysis
- Conditions for the completeness of functional and algebraic equational reasoning
- Declassification policy for program complexity analysis
- Fixed points of generalized contractive mappings
- Gaussian elimination is not optimal
- Groups of polynomial growth and expanding maps. Appendix by Jacques Tits
- Higher order interpretation for higher order complexity
- scientific article; zbMATH DE number 2221693 (Why is no real title available?)
- Logical aspects of rates of convergence in metric spaces
- Markov chains and mixing times. With a chapter on ``Coupling from the past by James G. Propp and David B. Wilson.
- Metric entropy and approximation
- On a class of \(O(n^ 2)\) problems in computational geometry
- On basic feasible functionals and the interpretation method
- Parametrised second-order complexity theory with applications to the study of interval computation
- Polyfunctions over commutative rings
- Polynomial and abstract subrecursive classes
- Primality testing in polynomial time. From randomized algorithms to ``PRIMES is in P.
- Quantitative coding and complexity theory of \textit{continuous} data. I: Motivation, definition, consequences
- Second-order linear-time computability with applications to computable analysis
- Topological complexity with continuous operations
- Type-two polynomial-time and restricted lookahead
This page was built for publication: Degrees of second- and higher-order polynomials
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7391922)
