Babai's quasi-polynomial time algorithm
GPTKB entity
Statements (20)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:algorithm
|
| gptkbp:announced |
gptkb:University_of_Chicago
gptkb:public_lecture |
| gptkbp:complexity |
quasi-polynomial
|
| gptkbp:field |
gptkb:theoretical_computer_science
graph theory |
| gptkbp:impact |
major breakthrough in complexity theory
|
| gptkbp:previousBestTimeComplexity |
sub-exponential
|
| gptkbp:proposedBy |
gptkb:László_Babai
|
| gptkbp:relatedTo |
gptkb:combinatorics
group theory permutation groups |
| gptkbp:significance |
improved best known time for graph isomorphism
|
| gptkbp:solvedBy |
gptkb:graph_isomorphism_problem
|
| gptkbp:status |
peer review
preprint |
| gptkbp:yearProposed |
2015
|
| gptkbp:bfsParent |
gptkb:graph_isomorphism_problem
|
| gptkbp:bfsLayer |
6
|
| https://www.w3.org/2000/01/rdf-schema#label |
Babai's quasi-polynomial time algorithm
|