The following pages link to (Q3747725):
Displaying 30 items.
- Revisiting a result of Ko (Q286990) (← links)
- Effective entropies and data compression (Q751832) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- On sparse oracles separating feasible complexity classes (Q1111385) (← links)
- Unambiguous computations and locally definable acceptance types (Q1127545) (← links)
- On polynomial time one-truth-table reducibility to a sparse set (Q1191028) (← links)
- On the power of enumerative counting (Q1199550) (← links)
- A note on sparse sets and the polynomial-time hierarchy (Q1263964) (← links)
- Creating strong, total, commutative, associative one-way functions from any one-way function in complexity theory (Q1307703) (← links)
- Gap-definable counting classes (Q1318473) (← links)
- Non-deterministic communication complexity with few witnesses (Q1337464) (← links)
- Scalability and the isomorphism problem (Q1351582) (← links)
- On characterizing the existence of partial one-way permutations (Q1603545) (← links)
- Enumerative counting is hard (Q1822963) (← links)
- On the power of unambiguity in log-space (Q1926109) (← links)
- The complexity of irredundant sets parameterized by size (Q1971218) (← links)
- Quantum and classical complexity classes: Separations, collapses, and closure properties (Q2486397) (← links)
- If P \(\neq\) NP then some strongly noninvertible functions are invertible (Q2508963) (← links)
- Sparse and Lopsided Set Disjointness via Information Theory (Q3167423) (← links)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets (Q3210177) (← links)
- (Q3830530) (← links)
- Structure and importance of logspace-MOD class (Q4009813) (← links)
- (Q4259984) (← links)
- (Q4359456) (← links)
- (Q4373559) (← links)
- On sets bounded truth-table reducible to $P$-selective sets (Q4717049) (← links)
- The Untold Story of $$\mathsf {SBP}$$ (Q5042261) (← links)
- On the power of parity polynomial time (Q5096157) (← links)
- Counting classes: Thresholds, parity, mods, and fewness (Q5905584) (← links)
- Unambiguity and fewness for nonuniform families of polynomial-size nondeterministic finite automata (Q6173104) (← links)
