The following pages link to (Q4160434):
Displaying 23 items.
- A note on P-selective sets and closeness (Q673619) (← links)
- Some consequences of non-uniform conditions on uniform classes (Q794427) (← links)
- Padding, commitment and self-reducibility (Q808694) (← links)
- A result relating disjunctive self-reducibility to P-immunity (Q915447) (← links)
- On self-reducibility and weak P-selectivity (Q1054475) (← links)
- Reductions among polynomial isomorphism types (Q1077412) (← links)
- Collapsing degrees (Q1109766) (← links)
- The maximum value problem and NP real numbers (Q1161742) (← links)
- On the structure of sets in NP and other complexity classes (Q1162811) (← links)
- A uniform approach to obtain diagonal sets in complexity classes (Q1164414) (← links)
- A note on sparse oracles for NP (Q1164997) (← links)
- Sparse complete sets for NP: solution of a conjecture of Berman and Hartmanis (Q1168733) (← links)
- Space-efficient recognition of sparse self-reducible languages (Q1337147) (← links)
- Computation times of NP sets of different densities (Q1348523) (← links)
- Relativizing relativized computations (Q1822968) (← links)
- Affine automata verifiers (Q2152088) (← links)
- A note on bi-immunity and \(p\)-closeness of \(p\)-cheatable sets in \(P\)/poly (Q2366689) (← links)
- On the complexity of computing the Hausdorff distance (Q2434923) (← links)
- Self-reducibility (Q2639637) (← links)
- Classes of bounded nondeterminism (Q3034815) (← 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)
- Monotonous and randomized reductions to sparse sets (Q4717050) (← links)
