The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (Q2235760)
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 7412752
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems |
scientific article; zbMATH DE number 7412752 |
Statements
The exponential-time hypothesis and the relative complexity of optimization and logical reasoning problems (English)
0 references
21 October 2021
0 references
constraint satisfaction problems
0 references
fine-grained complexity
0 references
universal algebra
0 references
0 references
0.9297186
0 references
0.8808197
0 references
0.87724316
0 references
0.87272036
0 references
0.87007785
0 references
0.86318535
0 references
0.8613844
0 references
0.8604739
0 references
0.85873616
0 references
