The following pages link to Complete problems for monotone NP (Q673092):
Displaying 10 items.
- Graph properties checkable in linear time in the number of vertices (Q596315) (← links)
- Using the Hamiltonian path operator to capture NP (Q1198664) (← links)
- Trahtenbrot-Zykov problem and NP-completeness (Q1201257) (← links)
- Heuristics and exact algorithms for solving the Monden problem (Q1266568) (← links)
- On locating cubic subgraphs in bounded-degree connected bipartite graphs (Q1356566) (← links)
- MPF problem over modified medial semigroup is NP-complete (Q2333870) (← links)
- Logical Description of Monotone NP Problems (Q4305345) (← links)
- A Proof of the Algebraic Tractability Conjecture for Monotone Monadic SNP (Q4957913) (← links)
- The Monotone Satisfiability Problem with Bounded Variable Appearances (Q4963262) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)