Pages that link to "Item:Q4739905"
From MaRDI portal
The following pages link to Analogues of semirecursive sets and effective reducibilities to the study of NP complexity (Q4739905):
Displaying 20 items.
- Some results on selectivity and self-reducibility (Q672402) (← links)
- P-selectivity: Intersections and indices (Q673115) (← links)
- Choosing, agreeing, and eliminating in communication complexity (Q744609) (← links)
- A result relating disjunctive self-reducibility to P-immunity (Q915447) (← links)
- On helping by robust oracle machines (Q1097695) (← links)
- Geometric optimization and the polynomial hierarchy (Q1102110) (← links)
- Polynomial terse sets (Q1104077) (← links)
- Geometric optimization and \(D^ P\)-completeness (Q1106665) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- On sets polynomially enumerable by iteration (Q1176233) (← links)
- On the size of classes with weak membership properties (Q1274925) (← links)
- Some connections between bounded query classes and non-uniform complexity. (Q1426008) (← links)
- Recursion-theoretic ranking and compression (Q1713478) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- The Power of Self-Reducibility: Selectivity, Information, and Approximation (Q3297822) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- On polynomially D verbose sets (Q5048933) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
