Pages that link to "Item:Q1094875"
From MaRDI portal
The following pages link to Honest polynomial degrees and \(P=?NP\) (Q1094875):
Displaying 7 items.
- Cook reducibility is faster than Karp reducibility in NP (Q751812) (← links)
- Honest polynomial time reducibilities and the \(P=?NP\) problem (Q909455) (← links)
- On \(\Pi_ 2\) theories of \(hp-T\) degrees of low sets (Q1314385) (← links)
- The structure of the honest polynomial m-degrees (Q1341316) (← links)
- On computational complexity and honest polynomial degrees (Q2277252) (← links)
- The existence of minimal honest polynomial degree below and recursively enumerable degrees (Q3804685) (← links)
- (Q4010140) (← links)