en
italiano
english
français
española
中国
日本の
العربية
Deutsch
한국어
Português
Russian
Full articles
Categories
C#
PHP
PYTHON
JAVA
SQL SERVER
MYSQL
HTML
CSS
JQUERY
VUE
ReactJS
You write
User
Login
Registration
Password recovery
Tags
Language tags
Back-end
C#
PHP
JAVA
PYTHON
Database
Sql server
Mysql
Front-end
HTML
CSS
JQUERY
ANGULARJS
REACT
VUE.JS
Tag satisfiability - This is page 3 - GeneraCodice
Boolean satisfiability - algorithm
https://www.generacodice.com/en/articolo/4482724/boolean-satisfiability-algorithm
algorithm
-
satisfiability
StackOverflow
SAT/CNF optimization
https://www.generacodice.com/en/articolo/3532969/sat-cnf-optimization
algorithm
-
optimization
-
linear-programming
-
satisfiability
StackOverflow
Special cases of SAT and corresponding #SAT with complexity a most O(n^2) AND that have efficient algorithms for generating instances?
https://www.generacodice.com/en/articolo/3345016/special-cases-of-sat-and-corresponding-sat-with-complexity-a-most-o-n-2-and-that-have-efficient-algorithms-for-generating-instances
logic
-
enumeration
-
counting
-
satisfiability
-
time-complexity
StackOverflow
Universal Quantifiers in QBFs
https://www.generacodice.com/en/articolo/2478634/universal-quantifiers-in-qbfs
logic
-
satisfiability
cs.stackexchange
Is there an algorithm for reducing CNFs further
https://www.generacodice.com/en/articolo/2478276/is-there-an-algorithm-for-reducing-cnfs-further
satisfiability
-
algorithms
-
term-rewriting
-
normal-forms
cs.stackexchange
algorithm for checking satisfiability
https://www.generacodice.com/en/articolo/2476884/algorithm-for-checking-satisfiability
complexity-theory
-
computability
-
satisfiability
-
np
-
3-sat
cs.stackexchange
Complexity of specific cases of MAX2SAT
https://www.generacodice.com/en/articolo/2475077/complexity-of-specific-cases-of-max2sat
complexity-theory
-
np-complete
-
satisfiability
-
reductions
-
2-sat
cs.stackexchange
How many clauses are required for SAT to be NP-hard in CNF formulas?
https://www.generacodice.com/en/articolo/2473136/how-many-clauses-are-required-for-sat-to-be-np-hard-in-cnf-formulas
complexity-theory
-
logic
-
satisfiability
cs.stackexchange
Equivalence of Krom formulas tractable?
https://www.generacodice.com/en/articolo/2472731/equivalence-of-krom-formulas-tractable
complexity-theory
-
logic
-
satisfiability
-
propositional-logic
cs.stackexchange
Is Monotone 3-SAT with exactly 3 distinct variables untractable?
https://www.generacodice.com/en/articolo/2472212/is-monotone-3-sat-with-exactly-3-distinct-variables-untractable
np-complete
-
satisfiability
-
3-sat
-
propositional-logic
-
polynomial-time-reductions
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 510