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 3-sat - This is page 1 - GeneraCodice
algorithm for checking satisfiability
https://www.generacodice.com/en/articolo/2476884/algorithm-for-checking-satisfiability
complexity-theory
-
computability
-
satisfiability
-
np
-
3-sat
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
Proof for NP-hardness of simultaneous minimization and maximization of a weighted subset
https://www.generacodice.com/en/articolo/2471120/proof-for-np-hardness-of-simultaneous-minimization-and-maximization-of-a-weighted-subset
np-complete
-
satisfiability
-
np-hard
-
np
-
3-sat
cs.stackexchange
Unique 3SAT to Unique 1-in-3SAT
https://www.generacodice.com/en/articolo/2464133/unique-3sat-to-unique-1-in-3sat
complexity-theory
-
np-complete
-
satisfiability
-
np
-
3-sat
cs.stackexchange
Unique 1-in-3 SAT
https://www.generacodice.com/en/articolo/2464057/unique-1-in-3-sat
satisfiability
-
np
-
3-sat
cs.stackexchange
How to prove finding two paths that are at least k edges apart is NP-hard?
https://www.generacodice.com/en/articolo/2463884/how-to-prove-finding-two-paths-that-are-at-least-k-edges-apart-is-np-hard
np-hard
-
3-sat
-
graphs
cs.stackexchange
Time complexities of state-of-the-art SAT solvers with respect to length of the formula
https://www.generacodice.com/en/articolo/2455775/time-complexities-of-state-of-the-art-sat-solvers-with-respect-to-length-of-the-formula
turing-machines
-
satisfiability
-
time-complexity
-
3-sat
-
p-vs-np
cs.stackexchange
Random restarts for unsatisfiable instances
https://www.generacodice.com/en/articolo/1620585/random-restarts-for-unsatisfiable-instances
satisfiability
-
sat-solvers
-
3-sat
-
randomized-algorithms
cs.stackexchange
3-CNF to “independent form”
https://www.generacodice.com/en/articolo/1615377/3-cnf-to-independent-form
logic
-
3-sat
-
propositional-logic
-
boolean-algebra
cs.stackexchange
Is a “local” version of 3-SAT NP-hard?
https://www.generacodice.com/en/articolo/1612712/is-a-local-version-of-3-sat-np-hard
satisfiability
-
np-hard
-
3-sat
-
polynomial-time
-
2-sat
cs.stackexchange
«
1
2
3
4
5
6
»
Results found: 113