The following pages link to Alan L. Selman (Q161380):
Displaying 38 items.
- A survey of one-way functions in complexity theory (Q4009812) (← links)
- Relativized Halting Problems (Q4052105) (← links)
- Inclusion complete tally languages and the Hartmanis-Berman conjecture (Q4140380) (← links)
- (Q4159038) (← links)
- (Q4162480) (← links)
- Polynomial Time Enumeration Reducibility (Q4167585) (← links)
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP (Q4190619) (← links)
- 3D adaptive mesh refinement (Q4213690) (← links)
- Complements of multivalued functions (Q4259998) (← links)
- Fine Separation of Average-Time Complexity Classes (Q4268711) (← links)
- (Q4281541) (← links)
- Two‐dimensional transient dynamic analysis with adaptive mesh refinement (Q4282304) (← links)
- Oracles That Compute Values (Q4376168) (← links)
- Multi-mesh and adaptivity in 3D shape optimization (Q4387544) (← links)
- Adaptive mesh refinement for localised phenomena (Q4394127) (← links)
- Sets of Formulas Valid in Finite Structures (Q4401428) (← links)
- (Q4525684) (← links)
- Fine separation of average time complexity classes (Q4593943) (← links)
- Disjoint NP-Pairs (Q4651518) (← links)
- (Q4736858) (← links)
- Analogues of semirecursive sets and effective reducibilities to the study of NP complexity (Q4739905) (← links)
- Turing machines and the spectra of first-order formulas (Q4775859) (← links)
- Boundary layers in uniform and variable thickness plates with rectangular and curved planforms using the finite strip method (Q4850215) (← links)
- NONDETERMINISTICALLY SELECTIVE SETS (Q4867411) (← links)
- Computing Solutions Uniquely Collapses the Polynomial Hierarchy (Q4895826) (← links)
- (Q4937192) (← links)
- Structural Properties of Nonautoreducible Sets (Q4973856) (← links)
- Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions (Q5326584) (← links)
- Redundancy in Complete Sets (Q5449820) (← links)
- Non-mitotic Sets (Q5458830) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492874) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492875) (← links)
- Arithmetical Reducibilities I (Q5636865) (← links)
- Arithmetical Reducibilities II (Q5648352) (← links)
- Applications of Forcing to the Degree-Theory of the Arithmetical Hierarchy (Q5663848) (← links)
- Theory and Applications of Models of Computation (Q5898860) (← links)
- Computability and complexity theory (Q5925717) (← links)
- Distributionally hard languages (Q5945724) (← links)
