Pages that link to "Item:Q2345861"
From MaRDI portal
The following pages link to The exact complexity of the infinite Post Correspondence Problem (Q2345861):
Displaying 11 items.
- More decidable instances of Post's correspondence problem: beyond counting (Q963345) (← links)
- Infinite versions of some problems from finite complexity theory (Q1374209) (← links)
- The Post correspondence problem over a unary alphabet (Q1431872) (← links)
- P, NP, and the Post correspondence problem (Q1899905) (← links)
- Undecidability of infinite Post correspondence problem for instances of size 8 (Q2905329) (← links)
- Undecidability of infinite post correspondence problem for instances of Size 9 (Q3423136) (← links)
- The Complexity of Circumscriptive Inference in Post’s Lattice (Q3643126) (← links)
- (Q3745832) (← links)
- (Q4530147) (← links)
- The Complexity of Problems in P Given Correlated Instances (Q4638062) (← links)
- On bi-infinite and conjugate post correspondence problems (Q6186538) (← links)