@inproceedings{Garg:2018:MCL:3188745.3188838,
Address = {New York, NY, USA},
Author = {Garg, Ankit and G\"{o}\"{o}s, Mika and Kamath, Pritish and Sokolov, Dmitry},
BookTitle = {Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing},
File = {Monotone Circuit Lower Bounds from Resolution - stoc18main-p179-p - a - a - k.pdf},
ISBN = {978-1-4503-5559-9},
Keywords = {Circuit complexity, proof complexity},
Location = {Los Angeles, CA, USA},
Pages = {902--911},
Publisher = {ACM},
Series = {STOC 2018},
Title = {Monotone Circuit Lower Bounds from Resolution},
URL = {http://doi.acm.org/10.1145/3188745.3188838},
Year = {2018},
acmid = {3188838},
bdsk-url-1 = {http://doi.acm.org/10.1145/3188745.3188838},
bdsk-url-2 = {https://doi.org/10.1145/3188745.3188838},
date-added = {2019-10-14 17:41:56 +0200},
date-modified = {2019-10-14 17:41:56 +0200},
file-2 = {Monotone circuit lower bounds from resolution - TR17-175 - a - a - k.pdf},
numpages = {10},
doi = {10.1145/3188745.3188838}
}
Library Size: 13G (12941 entries),
Last Updated: Apr 04, 2026, 18:14:59,
Build Time: N/A