Algorithms for Sat and upper bounds on their complexity (Q2487388): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / author | |||
| Property / author: Maxim Vsemirnov / rank | |||
| Property / author | |||
| Property / author: Maxim Vsemirnov / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1023/a:1025645221773 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W190339048 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 10:36, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithms for Sat and upper bounds on their complexity |
scientific article |
Statements
Algorithms for Sat and upper bounds on their complexity (English)
0 references
5 August 2005
0 references
propositional satisfiability problem
0 references
