Pages that link to "Item:Q2947565"

The following pages link to Complexity Theory for Operators in Analysis (Q2947565):

Displaying 20 items.

• Type-two polynomial-time and restricted lookahead (Q1989320) (← links)
• Polynomial time over the reals with parsimony (Q2039933) (← links)
• Quantitative coding and complexity theory of compact metric spaces (Q2106606) (← links)
• Bit-complexity of solving systems of linear evolutionary partial differential equations (Q2117092) (← links)
• Parametrised second-order complexity theory with applications to the study of interval computation (Q2285136) (← links)
• Analytical properties of resource-bounded real functionals (Q2509953) (← links)
• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations (Q2693688) (← links)
• Many-one reductions and the category of multivalued functions (Q2973252) (← links)
• Towards Computational Complexity Theory on Advanced Function Spaces in Analysis (Q3188250) (← links)
• On the computational complexity of the Dirichlet Problem for Poisson's Equation (Q4593239) (← links)
• (Q4989411) (← links)
• Representations and evaluation strategies for feasibly approximable functions (Q4995603) (← links)
• Average-case polynomial-time computability of hamiltonian dynamics (Q5005130) (← links)
• Computability of Differential Equations (Q5024569) (← links)
• Computable Measure Theory and Algorithmic Randomness (Q5024573) (← links)
• Polynomial Running Times for Polynomial-Time Oracle Machines (Q5111319) (← links)
• (Q5155667) (← links)
• Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
• The ksmt calculus is a \(\delta \)-complete decision procedure for non-linear constraints (Q6076350) (← links)
• Semantics, specification logic, and Hoare logic of exact real computation (Q6563064) (← links)