The following pages link to Ker-I Ko (Q1295380):
Displaying 23 items.
- A note on separating the relativized polynomial time hierarchy by immune sets (Q3479518) (← links)
- Some negative results on the computational complexity of total variation and differentiation (Q3671162) (← links)
- On Circuit-Size Complexity and the Low Hierarchy in NP (Q3675520) (← links)
- Nonlevelable sets and immune sets in the accepting density hierarchy inNP (Q3711750) (← links)
- On the number of queries necessary to identify a permutation (Q3768415) (← links)
- Searching for Two Objects by Underweight Feedback (Q3792251) (← links)
- Some Completeness Results on Decision Trees and Group Testing (Q3801062) (← links)
- On Sets Truth-Table Reducible to Sparse Sets (Q3816983) (← links)
- (Q4002474) (← links)
- (Q4035313) (← links)
- (Q4205080) (← links)
- Instance complexity (Q4299297) (← links)
- (Q4460840) (← links)
- (Q4727431) (← links)
- Relativized Polynomial Time Hierarchies Having Exactly <i>K</i> Levels (Q4729353) (← links)
- Computational Complexity of Two-Dimensional Regions (Q4857588) (← links)
- (Q4883380) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
- (Q4942157) (← links)
- Some complexity issues on the simply connected regions of the two-dimensional plane (Q5248466) (← links)
- Theory of Computational Complexity (Q5400669) (← links)
- Computing and Combinatorics (Q5716952) (← links)