arXiv (OAI Expanded)
open access
On the Complexity of Finding Fixed Points for Set-Valued Contractions
In this paper, we study the computational complexity of finding fixed points for set-valued contractions. We first formulate a computational problem for Nadler's fixed-point theorem: Projected-Nadler, and prove that it is $\mathsf{CLS}$-complete by showing its equivalence to Continuous-LocalOpt. We
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Almost Optimal FPT Inapproximability for k-SetCover#1014273
- Infinite Communication Complexity and KW Games#820057
- Minimal Resolving Sets in Rectangular Grid Graphs: A Complete Characterization and Enumeration#1130738
- Defining sets of full designs with block size three II#954713
- A general framework for a Second Philosophy analysis of set-theoretic methodology#117048
Record · ID 1083573
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive