Computational complexity of fixed points and intersection points

DOI10.1006/JCOM.1995.1011MaRDI QIDQ1893076zbMATH OpenOpenAlexFDO

Authors Ker-I Ko

Publication date 18 March 1996

Published in Journal of Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jcom.1995.1011

zbMATH Keywords

computational complexitycomplexity class

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Recommendations

• The Brouwer fixed point theorem revisited
• Complexity of fixed point computation
• Computational complexity of fixed points
• On the complexity of 2D discrete fixed point problem
• On the complexity of finding a Caristi's fixed point

Cited in

(13)

• Computational complexity of compaction to irreflexive cycles
• On the complexity of finding a Caristi's fixed point
• Point searching in real singularcomplete intersection varieties: algorithms of intrinsic complexity
• A polynomial time computable metric between points sets
• The Brouwer fixed point theorem revisited
• Computability structure of the Sobolev spaces and its applications
• The complexity of point configurations
• Computable intersection points
• scientific article; zbMATH DE number 741008 (Why is no real title available?)
• Bit complexity for computing one point in each connected component of a smooth real algebraic set
• On the Complexity of 2D Discrete Fixed Point Problem
• Equilibria, fixed points, and complexity classes
• A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality

This page was built for publication: Computational complexity of fixed points and intersection points

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