Babai's quasi-polynomial time algorithm
GPTKB entity
Statements (20)
Predicate | Object |
---|---|
gptkbp:instanceOf |
gptkb:algorithm
|
gptkbp:announced |
gptkb:University_of_Chicago
public lecture |
gptkbp:complexity |
quasi-polynomial
|
gptkbp:field |
theoretical computer science
graph theory |
https://www.w3.org/2000/01/rdf-schema#label |
Babai's quasi-polynomial time algorithm
|
gptkbp:impact |
major breakthrough in complexity theory
|
gptkbp:previousBestTimeComplexity |
sub-exponential
|
gptkbp:proposedBy |
gptkb:László_Babai
|
gptkbp:relatedTo |
group theory
combinatorics 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
|