Pages that link to "Item:Q2310754"
From MaRDI portal
The following pages link to On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754):
Displaying 10 items.
- On strongly planar not-all-equal 3SAT (Q326466) (← links)
- Partitioning \(H\)-free graphs of bounded diameter (Q2166756) (← links)
- Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
- On simplified NP-complete variants of \textsc{Monotone} 3\textsc{-Sat} (Q2223685) (← links)
- Parameterized Complexity of Conflict-Free Graph Coloring (Q4959657) (← links)
- Hard satisfiable 3-SAT instances via autocorrelation (Q5015598) (← links)
- ON LOCALLY-BALANCED 2-PARTITIONS OF BIPARTITE GRAPHS (Q5100156) (← links)
- Conditional hardness for satisfiable 3-CSPs (Q5172744) (← links)
- Theory and Applications of Satisfiability Testing (Q5325860) (← links)
- Cutting Barnette graphs perfectly is hard (Q6589850) (← links)