Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (Q2238592): 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.1016/j.artint.2021.103505 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3155946679 / rank | |||
Normal rank | |||
Latest revision as of 23:51, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms |
scientific article |
Statements
Acyclic orders, partition schemes and CSPs: unified hardness proofs and improved algorithms (English)
0 references
2 November 2021
0 references
constraint satisfaction problems
0 references
infinite domains
0 references
partition schemes
0 references
lower bounds
0 references
