The following pages link to Homer, Steven (Q161379):
Displayed 44 items.
- (Q585661) (redirect page) (← links)
- Computability and complexity theory. (Q640476) (← links)
- Oracle-dependent properties of the lattice of NP sets (Q795829) (← links)
- Honest polynomial degrees and \(P=?NP\) (Q1094875) (← links)
- On simple and creative sets in NP (Q1099614) (← links)
- Quadratic automata (Q1168081) (← links)
- Doubly-periodic sequences and a class of two-dimensional cyclic codes (Q1190768) (← links)
- Oracles for structural properties: The isomorphism problem and public-key cryptography (Q1190988) (← links)
- Almost-everywhere complexity hierarchies for nondeterministic time (Q1261465) (← links)
- On 1-truth-table-hard languages (Q1261477) (← links)
- Immunity of complete problems (Q1322467) (← links)
- On reductions of NP sets to sparse sets (Q1329162) (← links)
- Minimal pairs and complete problems (Q1334663) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- Learning counting functions with queries (Q1390865) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- Non-uniform reductions (Q1959376) (← links)
- (Q3026341) (← links)
- Intermediate <i>β</i>-r.e. degrees and the half-jump (Q3310602) (← links)
- (Q3355230) (← links)
- (Q3483270) (← links)
- Nonuniform lower bounds for exponential time classes (Q3569008) (← links)
- Relativizations comparing NP and exponential time (Q3675521) (← links)
- Doubly-Periodic Sequences and Two-Dimensional Recurrences (Q3688480) (← links)
- (Q3705435) (← links)
- (Q3745831) (← links)
- Minimal degrees for polynomial reducibilities (Q3781091) (← links)
- Absolute results concerning one-way functions and their applications (Q3833992) (← links)
- Two splitting theorems for beta-recursion theory (Q3924191) (← links)
- Degrees of Non α‐Speedable Sets (Q3968918) (← links)
- (Q3975929) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- (Q4256650) (← links)
- (Q4259998) (← links)
- (Q4359459) (← links)
- Oracles That Compute Values (Q4376168) (← links)
- (Q4619826) (← links)
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417) (← links)
- Fundamentals of Computation Theory (Q5492915) (← links)
- (Q5687254) (← links)
- (Q5753945) (← links)
- Computability and complexity theory (Q5925717) (← links)
- Finding a hidden code by asking questions (Q6142891) (← links)
- Fixed-Parameter Extrapolation and Aperiodic Order (Q6237968) (← links)