Computational complexity of fixed points and intersection points

DOI10.1006/JCOM.1995.1011zbMATH Open0834.68031OpenAlexW1976111241MaRDI QIDQ1893076FDOQ1893076

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

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

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)

Cited In (13)

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

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)