Babai's quasipolynomial time algorithm (2016)
GPTKB entity
Statements (19)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:announced |
gptkb:University_of_Chicago
|
| gptkbp:citation |
arXiv:1512.03547
|
| gptkbp:complexity |
quasipolynomial
|
| gptkbp:field |
theoretical computer science
graph theory |
| https://www.w3.org/2000/01/rdf-schema#label |
Babai's quasipolynomial time algorithm (2016)
|
| gptkbp:impact |
reduced the gap between known upper and lower bounds for graph isomorphism
|
| gptkbp:previousBestTimeComplexity |
subexponential
|
| gptkbp:proposedBy |
gptkb:László_Babai
|
| gptkbp:publishedIn |
preprint
|
| gptkbp:relatedTo |
group theory
combinatorics permutation groups |
| gptkbp:significance |
improved best known time for graph isomorphism
|
| gptkbp:solvedBy |
gptkb:graph_isomorphism_problem
|
| gptkbp:yearProposed |
2016
|
| gptkbp:bfsParent |
gptkb:graph_automorphism_problem
|
| gptkbp:bfsLayer |
7
|