@article{Kabanets_2004,
    doi = {10.1007/s00037-004-0182-6},
    url = {https://doi.org/10.1007%2Fs00037-004-0182-6},
    year = {2004},
    month = {dec},
    publisher = {Springer Science and Business Media {LLC}},
    volume = {13},
    number = {1-2},
    pages = {1--46},
    author = {Valentine Kabanets and Russell Impagliazzo},
    title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds},
    journal = {computational complexity}
}

@article{Kabanets_2004, doi = {10.1007/s00037-004-0182-6}, url = {https://doi.org/10.1007%2Fs00037-004-0182-6}, year = {2004}, month = {dec}, publisher = {Springer Science and Business Media {LLC}}, volume = {13}, number = {1-2}, pages = {1--46}, author = {Valentine Kabanets and Russell Impagliazzo}, title = {Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds}, journal = {computational complexity} }