Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Cody Murray
@article{DBLP:journals/siamcomp/MurrayW20,
author = {Cody D. Murray and
R. Ryan Williams},
title = {Circuit Lower Bounds for Nondeterministic Quasi-polytime from a New
Easy Witness Lemma},
journal = {{SIAM} J. Comput.},
volume = {49},
number = {5},
year = {2020},
url = {https://doi.org/10.1137/18M1195887},
doi = {10.1137/18M1195887},
timestamp = {Thu, 26 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/MurrayW20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ChenMMW19,
author = {Lijie Chen and
Dylan M. McKay and
Cody D. Murray and
R. Ryan Williams},
editor = {Amir Shpilka},
title = {Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton
Theorems},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {30:1--30:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.30},
doi = {10.4230/LIPICS.CCC.2019.30},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/ChenMMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/McKayMW19,
author = {Dylan M. McKay and
Cody D. Murray and
R. Ryan Williams},
editor = {Moses Charikar and
Edith Cohen},
title = {Weak lower bounds on resource-bounded compression imply strong separations
of complexity classes},
booktitle = {Proceedings of the 51st Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2019, Phoenix, AZ, USA, June 23-26, 2019},
pages = {1215--1225},
publisher = {{ACM}},
year = {2019},
url = {https://doi.org/10.1145/3313276.3316396},
doi = {10.1145/3313276.3316396},
timestamp = {Sat, 22 Jun 2019 17:42:26 +0200},
biburl = {https://dblp.org/rec/conf/stoc/McKayMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ChenMMW19,
author = {Lijie Chen and
Dylan M. McKay and
Cody Murray and
R. Ryan Williams},
title = {Relations and Equivalences Between Circuit Lower Bounds and Karp-Lipton
Theorems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR19-075}},
year = {2019},
url = {https://eccc.weizmann.ac.il/report/2019/075},
eprinttype = {ECCC},
eprint = {TR19-075},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ChenMMW19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/ndltd/Murray18,
author = {Cody Murray},
title = {Connections between circuit analysis problems and circuit lower bounds},
school = {Massachusetts Institute of Technology, Cambridge, {USA}},
year = {2018},
url = {https://hdl.handle.net/1721.1/120467},
timestamp = {Wed, 04 May 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/ndltd/Murray18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/MurrayW18,
author = {Cody Murray and
R. Ryan Williams},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Circuit lower bounds for nondeterministic quasi-polytime: an easy
witness lemma for {NP} and {NQP}},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {890--901},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188910},
doi = {10.1145/3188745.3188910},
timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/MurrayW18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/MurrayW17,
author = {Cody D. Murray and
R. Ryan Williams},
title = {On the (Non) NP-Hardness of Computing Circuit Complexity},
journal = {Theory Comput.},
volume = {13},
number = {1},
pages = {1--22},
year = {2017},
url = {https://doi.org/10.4086/toc.2017.v013a004},
doi = {10.4086/TOC.2017.V013A004},
timestamp = {Sun, 21 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toc/MurrayW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MurrayW17,
author = {Cody D. Murray and
R. Ryan Williams},
editor = {Ryan O'Donnell},
title = {Easiness Amplification and Uniform Circuit Lower Bounds},
booktitle = {32nd Computational Complexity Conference, {CCC} 2017, July 6-9, 2017,
Riga, Latvia},
series = {LIPIcs},
volume = {79},
pages = {8:1--8:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.CCC.2017.8},
doi = {10.4230/LIPICS.CCC.2017.8},
timestamp = {Thu, 02 Feb 2023 13:27:05 +0100},
biburl = {https://dblp.org/rec/conf/coco/MurrayW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MurrayW17,
author = {Cody Murray and
R. Ryan Williams},
title = {Circuit Lower Bounds for Nondeterministic Quasi-Polytime: An Easy
Witness Lemma for {NP} and {NQP}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-188}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/188},
eprinttype = {ECCC},
eprint = {TR17-188},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MurrayW17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/MurrayW15,
author = {Cody D. Murray and
Richard Ryan Williams},
editor = {David Zuckerman},
title = {On the (Non) NP-Hardness of Computing Circuit Complexity},
booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
2015, Portland, Oregon, {USA}},
series = {LIPIcs},
volume = {33},
pages = {365--380},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.365},
doi = {10.4230/LIPICS.CCC.2015.365},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/MurrayW15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MurrayW14,
author = {Cody Murray and
Ryan Williams},
title = {On the (Non) NP-Hardness of Computing Circuit Complexity},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-164}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/164},
eprinttype = {ECCC},
eprint = {TR14-164},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MurrayW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/BatmanIMP13,
author = {Lucia Batman and
Russell Impagliazzo and
Cody Murray and
Ramamohan Paturi},
editor = {Prasad Raghavendra and
Sofya Raskhodnikova and
Klaus Jansen and
Jos{\'{e}} D. P. Rolim},
title = {Finding Heavy Hitters from Lossy or Noisy Data},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques - 16th International Workshop, {APPROX} 2013, and 17th
International Workshop, {RANDOM} 2013, Berkeley, CA, USA, August 21-23,
2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8096},
pages = {347--362},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-40328-6\_25},
doi = {10.1007/978-3-642-40328-6\_25},
timestamp = {Tue, 21 Sep 2021 09:36:24 +0200},
biburl = {https://dblp.org/rec/conf/approx/BatmanIMP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-25 01:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
