Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (Q3434543): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/11758471_9 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1710911229 / rank | |||
Normal rank |
Latest revision as of 01:47, 20 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms |
scientific article |
Statements
Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms (English)
0 references
2 May 2007
0 references