%0 Journal Article %1 journals/eccc/AllenderGMMM17 %A Allender, Eric %A Grochow, Joshua A. %A van Melkebeek, Dieter %A Moore, Cristopher %A Morgan, Andrew %D 2017 %J Electronic Colloquium on Computational Complexity (ECCC) %K dblp %P 158 %T Minimum Circuit Size, Graph Isomorphism, and Related Problems. %U http://dblp.uni-trier.de/db/journals/eccc/eccc24.html#AllenderGMMM17 %V 24

@article{journals/eccc/AllenderGMMM17, added-at = {2019-04-05T00:00:00.000+0200}, author = {Allender, Eric and Grochow, Joshua A. and van Melkebeek, Dieter and Moore, Cristopher and Morgan, Andrew}, biburl = {https://puma.ub.uni-stuttgart.de/bibtex/24ac946391196893a8f349deba408bd79/dblp}, ee = {https://eccc.weizmann.ac.il/report/2017/158}, interhash = {897db5c7bc668e222ec4f7291678bfc1}, intrahash = {4ac946391196893a8f349deba408bd79}, journal = {Electronic Colloquium on Computational Complexity (ECCC)}, keywords = {dblp}, pages = 158, timestamp = {2019-09-27T08:33:47.000+0200}, title = {Minimum Circuit Size, Graph Isomorphism, and Related Problems.}, url = {http://dblp.uni-trier.de/db/journals/eccc/eccc24.html#AllenderGMMM17}, volume = 24, year = 2017 }