Max Horn SAT and the minimum cut problem in directed hypergraphs (Q1380929)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Max Horn SAT and the minimum cut problem in directed hypergraphs |
scientific article; zbMATH DE number 1127720
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Max Horn SAT and the minimum cut problem in directed hypergraphs |
scientific article; zbMATH DE number 1127720 |
Statements
Max Horn SAT and the minimum cut problem in directed hypergraphs (English)
0 references
11 March 1998
0 references
maximum satisfiability
0 references
Horn clauses
0 references
minimum cut
0 references
generalized set covering
0 references
maximum Horn satisfiability problem
0 references
minimum cardinality cut
0 references
directed hypergraph
0 references
disjunctive programming
0 references
0 references
0.9223492
0 references
0.89306223
0 references
0.8886337
0 references
0.88386184
0 references
0.8800862
0 references
0.87896216
0 references
0 references
0.8774134
0 references
0.87164456
0 references
