Pages that link to "Item:Q909455"
From MaRDI portal
The following pages link to Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455):
Displaying 5 items.
- Strong polynomial-time reducibility (Q676314) (← links)
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
- On computational complexity and honest polynomial degrees (Q2277252) (← links)
- Weak completeness notions for exponential time (Q2322715) (← links)
- The theory of the polynomial many-one degrees of recursive sets is undecidable (Q5096783) (← links)
