%0 Conference Paper %1 conf/focs/KomargodskiNY17 %A Komargodski, Ilan %A Naor, Moni %A Yogev, Eylon %B FOCS %D 2017 %E Umans, Chris %I IEEE Computer Society %K dblp %P 622-632 %T White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing. %U http://dblp.uni-trier.de/db/conf/focs/focs2017.html#KomargodskiNY17 %@ 978-1-5386-3464-6

@inproceedings{conf/focs/KomargodskiNY17, added-at = {2023-03-23T00:00:00.000+0100}, author = {Komargodski, Ilan and Naor, Moni and Yogev, Eylon}, biburl = {https://www.bibsonomy.org/bibtex/23a1ee6dad76d445c57d5f2fb60d3db06/dblp}, booktitle = {FOCS}, crossref = {conf/focs/2017}, editor = {Umans, Chris}, ee = {https://doi.ieeecomputersociety.org/10.1109/FOCS.2017.63}, interhash = {1d67bd147da7304a7dfb7629f8c3b930}, intrahash = {3a1ee6dad76d445c57d5f2fb60d3db06}, isbn = {978-1-5386-3464-6}, keywords = {dblp}, pages = {622-632}, publisher = {IEEE Computer Society}, timestamp = {2024-04-10T14:13:12.000+0200}, title = {White-Box vs. Black-Box Complexity of Search Problems: Ramsey and Graph Property Testing.}, url = {http://dblp.uni-trier.de/db/conf/focs/focs2017.html#KomargodskiNY17}, year = 2017 }