Computational complexity of fixed points and intersection points

DOI10.1006/jcom.1995.1011zbMath0834.68031OpenAlexW1976111241MaRDI QIDQ1893076

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)

Related Items (3)

A graph-theoretical basis of stochastic-cascading network influence: characterizations of influence-based centrality ⋮ Equilibria, fixed points, and complexity classes ⋮ Computability structure of the Sobolev spaces and its applications

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