@inproceedings{Mulmuley_2012,
    doi = {10.1109/focs.2012.15},
    url = {https://doi.org/10.1109%2Ffocs.2012.15},
    year = {2012},
    month = {oct},
    publisher = {{IEEE}},
    author = {Ketan D. Mulmuley},
    title = {Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether{\textquotesingle}s Normalization Lemma},
    booktitle = {2012 {IEEE} 53rd Annual Symposium on Foundations of Computer Science}
}

@inproceedings{Mulmuley_2012, doi = {10.1109/focs.2012.15}, url = {https://doi.org/10.1109%2Ffocs.2012.15}, year = {2012}, month = {oct}, publisher = {{IEEE}}, author = {Ketan D. Mulmuley}, title = {Geometric Complexity Theory V: Equivalence between Blackbox Derandomization of Polynomial Identity Testing and Derandomization of Noether{\textquotesingle}s Normalization Lemma}, booktitle = {2012 {IEEE} 53rd Annual Symposium on Foundations of Computer Science} }