Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations (Q5044548)
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 7610424
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations |
scientific article; zbMATH DE number 7610424 |
Statements
Proof Complexity for the Maximum Satisfiability Problem and its Use in SAT Refutations (English)
0 references
1 November 2022
0 references
0 references
0.9174864
0 references
0.9174863
0 references
0.90946484
0 references
0.9087987
0 references
0.90658516
0 references
0 references
0.8989559
0 references
0.8985473
0 references
0.8985473
0 references
