scientific article

zbMATH Open0765.68052MaRDI QIDQ4035313FDOQ4035313

Ker-I Ko

Publication date: 18 May 1993

Title of this publication is not available (Why is that?)

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

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)

Cited In (4)

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

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)