Real functions, contraction mappings, and P-completeness

DOI10.1016/0890-5401(91)90027-YzbMath0734.68051OpenAlexW1974938461MaRDI QIDQ811127

H. James Hoover

Publication date: 1991

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(91)90027-y

zbMATH Keywords

continuous functionsreal numbersP-completeness\(NC=P\)Boolean circuit family

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity of computation (including implicit computational complexity) (03D15)

Related Items (2)

On parallel complexity of analytic functions ⋮ A theory of complexity for continuous time systems

Cites Work

• The computational complexity of maximization and integration
• Computational complexity of real functions
• On the definitions of computable real continuous functions
• Feasible Real Functions and Arithmetic Circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Real functions, contraction mappings, and P-completeness