On the computational complexity of integral equations

DOI10.1016/0168-0072(92)90028-XzbMath0760.68036OpenAlexW1964384382MaRDI QIDQ1207544

Ker-I. Ko

Publication date: 1 April 1993

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0168-0072(92)90028-x

zbMATH Keywords

upper boundlower boundLipschitz conditionVolterra equations

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Volterra integral equations (45D05)

Related Items (5)

A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ GLOBAL ATTRACTIVITY, ASYMPTOTIC STABILITY AND BLOW-UP POINTS FOR NONLINEAR FUNCTIONAL-INTEGRAL EQUATIONS’ SOLUTIONS AND APPLICATIONS IN BANACH SPACE BC(R+) WITH COMPUTATIONAL COMPLEXITY ⋮ On the computational complexity of the Dirichlet Problem for Poisson's Equation ⋮ Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations ⋮ In Memoriam: Ker-I Ko (1950–2018)

Cites Work

• The computational complexity of maximization and integration
• Complexity of differential and integral equations
• Computational complexity of real functions
• On the computational complexity of ordinary differential equations
• A computable ordinary differential equation which possesses no computable solution
• Almost-periodic behavior of solutions of a nonlinear Volterra system.
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the computational complexity of integral equations