On complexity of the satisfiability problem of systems over finite posets (Q5151206)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7311610
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On complexity of the satisfiability problem of systems over finite posets |
scientific article; zbMATH DE number 7311610 |
Statements
ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS (English)
0 references
17 February 2021
0 references
partially ordered sets
0 references
systems of equations
0 references
NP-completeness
0 references
0.7933700680732727
0 references
0.7892759442329407
0 references
0.7661454081535339
0 references
0.7659685611724854
0 references
