Pages that link to "Item:Q1374209"
From MaRDI portal
The following pages link to Infinite versions of some problems from finite complexity theory (Q1374209):
Displaying 12 items.
- Infinite computations and the generic finite (Q299410) (← links)
- The complexity of recursive constraint satisfaction problems (Q636283) (← links)
- Infinite time extensions of Kleene's \({\mathcal O}\) (Q1031833) (← links)
- Taking it to the limit: On infinite variants of NP-complete problems (Q1816727) (← links)
- Finitely repeated search and the diamond paradox (Q2043130) (← links)
- Domatic partitions of computable graphs (Q2436619) (← links)
- Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
- The Complexity of Infinite Computations In Models of Set Theory (Q3401139) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- (Q3828913) (← links)
- Reverse mathematics and Weihrauch analysis motivated by finite complexity theory (Q5037213) (← links)
- Definable inapproximability: new challenges for duplicator (Q5216336) (← links)