Pages that link to "Item:Q2440094"

The following pages link to XSAT and NAE-SAT of linear CNF classes (Q2440094):

Displaying 13 items.

• Exploring the complexity of the integer image problem in the \(\max\)-algebra (Q516821) (← links)
• The stable marriage problem with ties and restricted edges (Q783028) (← links)
• Exact satisfiability of linear CNF formulas (Q1627839) (← links)
• Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
• Constrained stable marriage with free edges or few blocking pairs (Q2150572) (← links)
• Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy (Q2182311) (← links)
• On a simple hard variant of \textsc{Not-All-Equal} 3-\textsc{Sat} (Q2310754) (← links)
• On the hardness of deciding the equality of the induced and the uniquely restricted matching number (Q2414056) (← links)
• On the complexity of packing rainbow spanning trees (Q2685331) (← links)
• NAE-resolution: A new resolution refutation technique to prove not-all-equal unsatisfiability (Q3386749) (← links)
• On the complexity of finding large odd induced subgraphs and odd colorings (Q5918338) (← links)
• (Q6065436) (← links)
• The complexity of optimizing atomic congestion (Q6665726) (← links)