The following pages link to (Q4942157):
Displaying 13 items.
- The polynomial hierarchy for some structures over the binary words (Q3423149) (← links)
- Improved lower bounds on the randomized complexity of graph properties (Q3437025) (← links)
- Complexity and Algorithms for Well-Structured k-SAT Instances (Q3502698) (← links)
- Arthur and Merlin as Oracles (Q3599130) (← links)
- Polynomial-time right-ideal morphisms and congruences (Q4686444) (← links)
- On the Complexity of Convex Hulls of Subsets of the Two-Dimensional Plane (Q4918034) (← links)
- On the Complexity of the Pancake Problem (Q4921438) (← links)
- Jordan Curves with Polynomial Inverse Moduli of Continuity (Q4921453) (← links)
- (Q5150651) (← links)
- $LINSPACE$ конструктивный аналог функции $(1+x)^h$ (Q5222062) (← links)
- On the complexity of the pancake problem (Q5307616) (← links)
- Managing complexity in industrial collaborations (Q5385486) (← links)
- Algorithms for randomized time-varying knapsack problems (Q5963612) (← links)