@inproceedings{Grohe:FOCS:1996,
    Author = {Grohe, Martin},
    BookTitle = {Proc. of FOCS'96},
    File = {Equivalence in finite-variable logics is complete for polynomial time - equivalence-in-finitevariable-logics-is-complete-for-polynomial- (0) - a - a - n.pdf},
    Keywords = {computational complexity;finite-variable logics;equivalence;polynomial time;finite structures;first order logic;graph isomorphism problem;complexity theoretic difficulties;quantifier-free reductions;completeness result;counting quantifiers;Logic;Polynomials;Sun;Councils;Labeling},
    Month = {Oct},
    Pages = {264--273},
    Title = {Equivalence in finite-variable logics is complete for polynomial time},
    Year = {1996},
    bdsk-url-1 = {https://doi.org/10.1109/SFCS.1996.548485},
    date-added = {2019-10-26 12:49:07 +0200},
    date-modified = {2019-10-26 12:49:33 +0200},
    doi = {10.1109/SFCS.1996.548485}
}

@inproceedings{Grohe:FOCS:1996, Author = {Grohe, Martin}, BookTitle = {Proc. of FOCS'96}, File = {Equivalence in finite-variable logics is complete for polynomial time - equivalence-in-finitevariable-logics-is-complete-for-polynomial- (0) - a - a - n.pdf}, Keywords = {computational complexity;finite-variable logics;equivalence;polynomial time;finite structures;first order logic;graph isomorphism problem;complexity theoretic difficulties;quantifier-free reductions;completeness result;counting quantifiers;Logic;Polynomials;Sun;Councils;Labeling}, Month = {Oct}, Pages = {264--273}, Title = {Equivalence in finite-variable logics is complete for polynomial time}, Year = {1996}, bdsk-url-1 = {https://doi.org/10.1109/SFCS.1996.548485}, date-added = {2019-10-26 12:49:07 +0200}, date-modified = {2019-10-26 12:49:33 +0200}, doi = {10.1109/SFCS.1996.548485} }