scientific article; zbMATH DE number 176209

MaRDI QIDQ4035313zbMATH OpenFDO

Authors Ker-I Ko

Publication date 18 May 1993

zbMATH Keywords

polynomial moduluslog-space computable real functionmodel of computation for real functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Functions of one variable (26A99)

Recommendations

• Inverting onto functions.
• Functional inversion and communication complexity
• Rigorous Time/Space Trade-offs for Inverting Functions
• Structural analysis of the complexity of inverse functions
• On the circuit-size of inverses

Cited in

(5)

• Real functions, contraction mappings, and P-completeness
• 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
• A CONTINUOUS ONE-TO-ONE FUNCTION WHOSE INVERSE IS NOWHERE CONTINUOUS
• Asymptotic granularity reduction and its application

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035313)