Tag: sat

Found 147 results for 'sat'.

1) graph-algorithms - What's the correlation between treewidth and instance hardness for random 3-SAT?
2) cc.complexity-theory - Ranking the Difficulty of NP Hard Problems in Practice
3) cc.complexity-theory - SAT Solution Space - Definition of Cluster of Solutions
4) cc.complexity-theory - Is bounded-width SAT decidable in logspace?
5) cc.complexity-theory - Ladner's Theorem vs. Schaefer's Theorem
6) cc.complexity-theory - How many sets of vectors can be represented as the solutions of a Horn-SAT instance?
7) cc.complexity-theory - Improving Cook's generic reduction for Clique to SAT?
8) cc.complexity-theory - Complexity of a satisfiability problem
9) cc.complexity-theory - What is the complexity of checking equivalence of two boolean formulae without NOT symbol?
10) cc.complexity-theory - Computational Model in SETH
11) cc.complexity-theory - Sparsification Lemma for k-SAT and Exponential Time Hypothesis
12) ds.algorithms - Reference request: complexity of $k$-partite $k$-SAT
13) sat - Random 3-SAT: What is the consensus experimental range of the threshold?
14) reference-request - Complexity of #SAT for monotone DNF formulae whose hypergraph is a hypertree
15) cc.complexity-theory - What's the complexity of Median-SAT?
16) ds.algorithms - Approximation Algorithms for MAXSAT
17) cc.complexity-theory - Solution Clusters and Monotone-2SAT
18) cc.complexity-theory - Reduction from SAT to 0,1 integer linear program with zero or one solutions
19) cc.complexity-theory - Counting solutions of Monotone-2CNF formulas
20) complexity-classes - Which subproblems of 3SAT are still NP complete?
21) cc.complexity-theory - Is embedding a solution feasible for SAT?
22) cc.complexity-theory - Count satisfying assignments of CNF formulas over all possible negation assignments
23) np-hardness - NP-hardness of a planar SAT variant
24) cc.complexity-theory - Direct SAT to 3-SAT reduction
25) cc.complexity-theory - A variant of Critical SAT in DP
26) cc.complexity-theory - What are the consequences of solving XOR 3-SAT in Logspace?
27) sat - Complexity of SAT parameterized by treewidth
28) graph-theory - Are there subexponential algorithms for PLANAR SAT known?
29) sat - Unique $k$-SAT benchmarks
30) cc.complexity-theory - Hardness of XSAT
31) sat - Reducing 3-XOR-SAT to HORN-SAT
32) reference-request - Translating SAT to HornSAT
33) cc.complexity-theory - How many instances of 3-SAT are satisfiable?
34) cc.complexity-theory - Best current space lower bound for SAT?
35) np-hardness - Can this NP-hardness proof for Super Mario Brothers (and other games) be simplified?
36) cc.complexity-theory - The worst-case scenario(s) for MAX3E SAT
37) reference-request - Limited number of variable occurrences in 1-in-3 SAT
38) ds.algorithms - SAT algorithms not based on DPLL
39) cc.complexity-theory - What is known about NP hard problems that access preprocessed information?
40) cc.complexity-theory - Shortest Equivalent CNF Formula
41) cc.complexity-theory - Does Horn SAT (Horn formula in CNF) have an integral polytope?
42) time-complexity - What are those deterministic algorithms for k-SAT that are not derandomization of random algorithms like PPSZ and Schöning's local search?
43) cc.complexity-theory - Is there an oracle such that SAT is not infinitely often in sub-exponential time?
44) sat - Counting the number of satisfying assignments in a POSITIVE CNF-SAT
45) np-hardness - What languages can be reduced to a NP-complete problem in polynomial time
46) cc.complexity-theory - Best SAT upper bounds based on number of clauses
47) cc.complexity-theory - What's the meaning of "input size" for 3-SAT?
48) cc.complexity-theory - Unique SAT vs Exactly $m$ models
49) time-complexity - Number of SAT checks that are needed to find all combinations of subset of boolean variables of a propositional formula
50) cc.complexity-theory - What are the current best known upper and lower bounds on the (un)satisfiability threshold for random k-sat and/or 3-sat?