Name
Abstract | ||
|---|---|---|
Counting models for two conjunctive forms (2-CF), problem known as #2SAT, is a classic #P-complete problem. We determine different discrete structures on the constrained graph of the 2-CF formula allowing the efficient computation of #2SAT. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1016/j.endm.2014.08.012 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
#SAT Problem,Counting models,Enumerative Algorithm,Efficient Counting | #SAT,Discrete mathematics,Graph,Combinatorics,Sat problem,Algorithm,#P-complete,Mathematics,Computation | Journal |
Volume | ISSN | Citations |
46 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Guillermo De Ita Luna | 1 | 29 | 16.57 |
| José Raymundo Marcial-Romero | 2 | 5 | 12.87 |
| Yolanda Moyao | 3 | 1 | 2.32 |