The following pages link to (Q4249726):
Displaying 16 items.
- Computing planarity in computable planar graphs (Q503647) (← links)
- Relative complexity of evaluating the optimum cost and constructing the optimum for maximization problems (Q915446) (← links)
- The complexity of optimization problems (Q1107309) (← links)
- Generalizations of Opt P to the polynomial hierarchy (Q1193867) (← links)
- Index sets for \(\Pi^0_1\) classes (Q1295386) (← links)
- Undecidability of equality for codata types (Q1798783) (← links)
- On the complexity of finding the chromatic number of a recursive graph. I: The bounded case (Q1825865) (← links)
- Forbidden substructures and combinatorial dichotomies: WQO and universality (Q2275384) (← links)
- Propositional circumscription and extended closed-world reasoning are \(\Pi_ 2^ P\)-complete (Q2367539) (← links)
- Domatic partitions of computable graphs (Q2436619) (← links)
- One query reducibilities between partial information classes (Q2575741) (← links)
- Reverse Mathematics and Recursive Graph Theory (Q4224080) (← links)
- (Q5009453) (← links)
- (Q5155667) (← links)
- Graph Ramsey theory and the polynomial hierarchy (Q5943091) (← links)
- Primitive recursive reverse mathematics (Q6050165) (← links)
