Into the square: on the complexity of some quadratic-time solvable problems (Q737085)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Into the square: on the complexity of some quadratic-time solvable problems |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Into the square: on the complexity of some quadratic-time solvable problems |
scientific article |
Statements
Into the square: on the complexity of some quadratic-time solvable problems (English)
0 references
5 August 2016
0 references
quadratic-time algorithms
0 references
reductions
0 references
strong exponential-time hypothesis
0 references
transitive closure
0 references
0 references
0.7190173268318176
0 references
0.7130209803581238
0 references
0.7063411474227905
0 references
0.7033746838569641
0 references
0.7033447027206421
0 references
