Automating tree-like resolution in time \(n^{o(\log n)}\) is \textsf{ETH}-hard (Q6890908)
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 8130496
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Automating tree-like resolution in time \(n^{o(\log n)}\) is \textsf{ETH}-hard |
scientific article; zbMATH DE number 8130496 |
Statements
Automating tree-like resolution in time \(n^{o(\log n)}\) is \textsf{ETH}-hard (English)
0 references
2 December 2025
0 references
automatability
0 references
tree-like resolution
0 references
exponential time hypothesis
0 references
