Pages that link to "Item:Q3347297"
From MaRDI portal
The following pages link to On relativized nondeterministic polynomial-time bounded computations (Q3347297):
Displaying 7 items.
- Relating the bounded arithmetic and polynomial time hierarchies (Q1899144) (← links)
- Bounded fixed-parameter tractability and \(\log^{2}n\) nondeterministic bits (Q2581756) (← links)
- Immunity, simplicity, probabilistic complexity classes and relativizations (Q3815527) (← links)
- RELATIVIZABLE AND NONRELATIVIZABLE THEOREMS IN THE POLYNOMIAL THEORY OF ALGORITHMS (Q4315092) (← links)
- A Shift-free Characterization of NP within Interval-valued Computing (Q4601153) (← links)
- (Q4733404) (← links)
- Polynomial-time computation via local inference relations (Q5738964) (← links)