Complexity of satisfiability problems with symmetric polynomial clauses (Q4344698)
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: Complexity of satisfiability problems with symmetric polynomial clauses |
scientific article; zbMATH DE number 1036291
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity of satisfiability problems with symmetric polynomial clauses |
scientific article; zbMATH DE number 1036291 |
Statements
Complexity of satisfiability problems with symmetric polynomial clauses (English)
0 references
12 January 1998
0 references
CNF-satisfiability
0 references
NP-complete problems
0 references
problem SAT
0 references
0.8254601955413818
0 references
0.8226514458656311
0 references
0.8059344291687012
0 references
0.7992122173309326
0 references
