The following pages link to Selman, Alan L. (Q161380):
Displayed 50 items.
- Item:Q161380 (redirect page) (← links)
- Item:Q161380 (redirect page) (← links)
- A thirty year old conjecture about promise problems (Q347124) (← links)
- Computability and complexity theory. (Q640476) (← links)
- Canonical disjoint NP-pairs of propositional proof systems (Q868942) (← links)
- Autoreducibility, mitoticity, and immunity (Q881593) (← links)
- The complexity of unions of disjoint sets (Q955349) (← links)
- Non-mitotic sets (Q1019177) (← links)
- Qualitative relativizations of complexity classes (Q1061119) (← links)
- Promise problems complete for complexity classes (Q1109568) (← links)
- Some observations on NP real numbers and P-selective sets (Q1164623) (← links)
- Reductions on NP and p-selective sets (Q1166515) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- A comparison of polynomial time reducibilities (Q1223166) (← links)
- A second step toward the polynomial hierarchy (Q1253656) (← links)
- Hard promise problems and nonuniform complexity (Q1261468) (← links)
- A hierarchy based on output multiplicity (Q1274991) (← links)
- A taxonomy of complexity classes of functions (Q1329166) (← links)
- Complete distributional problems, hard languages, and resource-bounded measure (Q1575682) (← links)
- \(p\)-Selective sets and reducing search to decision vs. self-reducibility (Q1816728) (← links)
- Bi-immunity separates strong NP-completeness notions (Q1887166) (← links)
- Adaptive versus nonadaptive queries to NP and P-selective sets (Q1961059) (← links)
- Reductions between disjoint NP-pairs (Q2387199) (← links)
- Polylogarithmic-round interactive proofs for coNP collapse the exponential hierarchy (Q2456368) (← links)
- Completeness of calculii for axiomatically defined classes of algebras (Q2556880) (← links)
- Separation of NP-Completeness Notions (Q2784487) (← links)
- A Thirty Year Old Conjecture about Promise Problems (Q2843273) (← links)
- (Q2965519) (← links)
- Introduction to Autoreducibility and Mitoticity (Q2973718) (← links)
- (Q3036702) (← links)
- Positive Relativizations of Complexity Classes (Q3343440) (← links)
- (Q3359757) (← links)
- Properties of NP‐Complete Sets (Q3434997) (← links)
- Splitting NP-Complete Sets (Q3532575) (← links)
- The Complexity of Unions of Disjoint Sets (Q3590939) (← links)
- The Informational Content of Canonical Disjoint NP-Pairs (Q3608856) (← links)
- THE INFORMATIONAL CONTENT OF CANONICAL DISJOINT NP-PAIRS (Q3636159) (← links)
- (Q3659676) (← links)
- The complexity of promise problems with applications to public-key cryptography (Q3722415) (← links)
- Quantitative Relativizations of Complexity Classes (Q3734382) (← links)
- (Q3760533) (← links)
- Characterizations of reduction classes modulo oracle conditions (Q3763590) (← links)
- Hard-core theorems for complexity classes (Q3769964) (← links)
- Complexity Measures for Public-Key Cryptosystems (Q3787917) (← links)
- Natural Self-Reducible Sets (Q3816974) (← links)
- (Q3830942) (← links)
- (Q3855156) (← links)
- (Q3975932) (← links)
- (Q3998345) (← links)
- (Q4005173) (← links)