Pages that link to "Item:Q4351919"
From MaRDI portal
The following pages link to On Nondeterminism, Enumeration Reducibility and Polynomial Bounds (Q4351919):
Displaying 12 items.
- Decompositions of nondeterministic reductions (Q1108263) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- Nondiamond theorems for polynomial time reducibility (Q1201882) (← links)
- A representable approach to finite nondeterminism (Q1391859) (← links)
- Reachability problems in nondeterministic polynomial maps on the integers (Q1622995) (← links)
- (Q3487329) (← links)
- On the Effective Enumerability of NP Problems (Q3499739) (← links)
- (Q3730019) (← links)
- The difference and truth-table hierarchies for NP (Q3783278) (← links)
- On the power of deterministic reductions to C=P (Q4032933) (← links)
- (Q4733404) (← links)
- Logical Approaches to Computational Barriers (Q5898819) (← links)