The following pages link to Stephen A. Fenner (Q393086):
Displaying 42 items.
- (Q234341) (redirect page) (← links)
- Functions that preserve p-randomness (Q393087) (← links)
- Gap-definability as a closure property (Q675219) (← links)
- The complexity of finding SUBSEQ\((A)\) (Q839630) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- An oracle builder's toolkit (Q1398366) (← links)
- PP-lowness and a simple definition of AWPP (Q1405795) (← links)
- Inverting onto functions. (Q1426007) (← links)
- Complexity of regex crosswords (Q2278278) (← links)
- The complexity of regex crosswords (Q2672653) (← links)
- Monochromatic Boxes in Colored Grids (Q3225105) (← links)
- (Q3395956) (← links)
- The complexity of learning SUBSEQ(<i>A</i>) (Q3399186) (← links)
- Game Values and Computational Complexity: An Analysis via Black-White Combinatorial Games (Q3459906) (← links)
- On the Complexity of the Hidden Subgroup Problem (Q3502634) (← links)
- The Complexity of Learning SUBSEQ (A) (Q3522980) (← links)
- (Q4230324) (← links)
- Bounded Immunity and Btt-Reductions (Q4238422) (← links)
- (Q4259998) (← links)
- (Q4281541) (← links)
- (Q4281550) (← links)
- Almost weakly 2-generic sets (Q4314677) (← links)
- Oracles That Compute Values (Q4376168) (← links)
- (Q4551212) (← links)
- Results on resource-bounded measure (Q4571951) (← links)
- Beyond PNP=NEXP (Q4596658) (← links)
- Weakly useful sequences (Q4645195) (← links)
- (Q4668728) (← links)
- The Isomorphism Conjecture Holds Relative to an Oracle (Q4875451) (← links)
- (Q4937192) (← links)
- Determining acceptance possibility for a quantum computation is hard for the polynomial hierarchy (Q4946417) (← links)
- (Q4967182) (← links)
- Bipartite Perfect Matching is in Quasi-NC (Q4997314) (← links)
- The Complexity of Poset Games (Q5084701) (← links)
- ON THE COMPLEXITY OF THE HIDDEN SUBGROUP PROBLEM (Q5168412) (← links)
- Quantum Algorithms for a Set of Group Theoretic Problems (Q5261611) (← links)
- Every polynomial-time 1-degree collapses if and only if P = PSPACE (Q5311749) (← links)
- Efficient Universal Quantum Circuits (Q5323090) (← links)
- Bipartite perfect matching is in quasi-NC (Q5361877) (← links)
- Theoretical Computer Science (Q5395074) (← links)
- Fundamentals of Computation Theory (Q5492915) (← links)
- Two oracles that force a big crunch (Q5957723) (← links)
