Inverting a one-to-one real function is inherently sequential

MaRDI QIDQ4035313zbMATH OpenFDO

Authors Ker-I Ko

Publication date 18 May 1993

zbMATH Keywords

log-space computable real functionmodel of computation for real functionspolynomial modulus

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(5)

• Bit-complexity of classical solutions of linear evolutionary systems of partial differential equations
• On the computational complexity of the Dirichlet problem for Poisson's equation
• A CONTINUOUS ONE-TO-ONE FUNCTION WHOSE INVERSE IS NOWHERE CONTINUOUS
• Asymptotic granularity reduction and its application
• Real functions, contraction mappings, and P-completeness

This page was built for publication: Inverting a one-to-one real function is inherently sequential

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