Pages that link to "Item:Q5959347"
From MaRDI portal
The following pages link to Theory of semi-feasible algorithms (Q5959347):
Displayed 11 items.
- The consequences of eliminating NP solutions (Q458458) (← links)
- Separating NE from some nonuniform nondeterministic complexity classes (Q652627) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Closure and nonclosure properties of the classes of compressible and rankable sets (Q2037201) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- Separating NE from Some Nonuniform Nondeterministic Complexity Classes (Q5323096) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- Dimension and the structure of complexity classes (Q6109065) (← links)
- Polynomial-time axioms of choice and polynomial-time cardinality (Q6109071) (← links)