1-in-3SAT: Difference between revisions

From Algorithm Wiki
Jump to navigation Jump to search
(Created page with "{{DISPLAYTITLE:1-in-3SAT (Boolean Satisfiability)}} == Description == 1-in-3SAT restricts the boolean formula to CNF with 3 literals per clause and determines whether there is an assignment of variables such that exactly 1 of the 3 literals in each clause is TRUE == Related Problems == Generalizations: 3SAT Subproblem: Monotone 1-in-3SAT, Monotone Not-Exactly-1-in-3SAT Related: SAT, Conjunctive Normal Form SAT, Disjunctive Normal Form SAT,...")
 
No edit summary
 
(One intermediate revision by the same user not shown)
Line 14: Line 14:
== Parameters ==  
== Parameters ==  


<pre>n: number of variables</pre>
$n$: number of variables


== Table of Algorithms ==  
== Table of Algorithms ==  


Currently no algorithms in our database for the given problem.
Currently no algorithms in our database for the given problem.

Latest revision as of 08:53, 10 April 2023

Description

1-in-3SAT restricts the boolean formula to CNF with 3 literals per clause and determines whether there is an assignment of variables such that exactly 1 of the 3 literals in each clause is TRUE

Related Problems

Generalizations: 3SAT

Subproblem: Monotone 1-in-3SAT, Monotone Not-Exactly-1-in-3SAT

Related: SAT, Conjunctive Normal Form SAT, Disjunctive Normal Form SAT, Monotone Not-Exactly-1-in-3SAT, All-Equal-SAT, Not-All-Equal 3-SAT (NAE 3SAT), Monotone Not-All-Equal 3-SAT (Monotone NAE 3SAT), k-SAT, 2SAT, 3SAT-5, 4SAT, Monotone 3SAT, XOR-SAT, Horn SAT, Dual-Horn SAT, Renamable Horn, MaxSAT

Parameters

$n$: number of variables

Table of Algorithms

Currently no algorithms in our database for the given problem.