{"id":"https://openalex.org/W2967736421","doi":"https://doi.org/10.1145/3313276.3316321","title":"Fooling polytopes","display_name":"Fooling polytopes","publication_year":2019,"publication_date":"2019-06-20","ids":{"openalex":"https://openalex.org/W2967736421","doi":"https://doi.org/10.1145/3313276.3316321","mag":"2967736421"},"language":"en","primary_location":{"id":"doi:10.1145/3313276.3316321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316321","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316321","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5051167298","display_name":"Ryan O\u2019Donnell","orcid":"https://orcid.org/0009-0005-5609-5795"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ryan O'Donnell","raw_affiliation_strings":["Carnegie Mellon University, USA"],"affiliations":[{"raw_affiliation_string":"Carnegie Mellon University, USA","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014866889","display_name":"Rocco A. Servedio","orcid":"https://orcid.org/0000-0003-2407-543X"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rocco A. Servedio","raw_affiliation_strings":["Columbia University, USA"],"affiliations":[{"raw_affiliation_string":"Columbia University, USA","institution_ids":["https://openalex.org/I78577930"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029451171","display_name":"Li-Yang Tan","orcid":"https://orcid.org/0000-0002-1279-4384"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Li-Yang Tan","raw_affiliation_strings":["Stanford University, USA"],"affiliations":[{"raw_affiliation_string":"Stanford University, USA","institution_ids":["https://openalex.org/I97018004"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5051167298"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":1.3997,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.83690274,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"614","last_page":"625"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9926000237464905,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9908999800682068,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/polytope","display_name":"Polytope","score":0.5293688774108887},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4732704162597656},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31634676456451416},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.23683395981788635}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.5293688774108887},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4732704162597656},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31634676456451416},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.23683395981788635}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3313276.3316321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316321","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3313276.3316321","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3313276.3316321","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3313276.3316321","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5921281487","display_name":null,"funder_award_id":"number","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7640071255","display_name":null,"funder_award_id":"CCF-1563155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7705943408","display_name":null,"funder_award_id":"CCF-1618679","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7933164293","display_name":null,"funder_award_id":"CCF-1717606","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G8728025545","display_name":"AF: Medium: Collaborative Research:  Circuit Lower Bounds via Projections","funder_award_id":"1563155","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G964039060","display_name":"AF: Small: Harmonic Analysis for Quantum Complexity","funder_award_id":"1618679","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2967736421.pdf","grobid_xml":"https://content.openalex.org/works/W2967736421.grobid-xml"},"referenced_works_count":47,"referenced_works":["https://openalex.org/W68011891","https://openalex.org/W1840740425","https://openalex.org/W1891181203","https://openalex.org/W1969727526","https://openalex.org/W1972100372","https://openalex.org/W1976697079","https://openalex.org/W1981115804","https://openalex.org/W1995851745","https://openalex.org/W1998918799","https://openalex.org/W2004507500","https://openalex.org/W2011438986","https://openalex.org/W2014485295","https://openalex.org/W2015194364","https://openalex.org/W2023915883","https://openalex.org/W2046242327","https://openalex.org/W2060474153","https://openalex.org/W2069124970","https://openalex.org/W2072331102","https://openalex.org/W2079887815","https://openalex.org/W2086789740","https://openalex.org/W2102339446","https://openalex.org/W2109322425","https://openalex.org/W2110503949","https://openalex.org/W2113141878","https://openalex.org/W2117294010","https://openalex.org/W2117439842","https://openalex.org/W2117475098","https://openalex.org/W2118259999","https://openalex.org/W2131464080","https://openalex.org/W2138092283","https://openalex.org/W2148858749","https://openalex.org/W2153408986","https://openalex.org/W2171867901","https://openalex.org/W2568404849","https://openalex.org/W2610386774","https://openalex.org/W2610739693","https://openalex.org/W2611754984","https://openalex.org/W2742067887","https://openalex.org/W2773065828","https://openalex.org/W2809890731","https://openalex.org/W2952911217","https://openalex.org/W3124277475","https://openalex.org/W4205550388","https://openalex.org/W4210720364","https://openalex.org/W4230448221","https://openalex.org/W4231678899","https://openalex.org/W6682590102"],"related_works":["https://openalex.org/W2748952813","https://openalex.org/W4280529077","https://openalex.org/W2507185596","https://openalex.org/W1493684871","https://openalex.org/W4286224459","https://openalex.org/W2886567582","https://openalex.org/W4289703404","https://openalex.org/W4387265813","https://openalex.org/W3103454236","https://openalex.org/W4320410061"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,31],"pseudorandom":[3],"generator":[4],"that":[5],"fools":[6],"m-facet":[7],"polytopes":[8],"over":[9],"{0,1}n":[10],"with":[11],"seed":[12,20],"length":[13,21],"polylog(m)":[14],"\u00b7":[15],"log(n).":[16],"The":[17],"previous":[18],"best":[19],"had":[22],"superlinear":[23],"dependence":[24],"on":[25],"m.":[26],"An":[27],"immediate":[28],"consequence":[29],"is":[30],"deterministic":[32],"quasipolynomial":[33],"time":[34],"algorithm":[35],"for":[36],"approximating":[37],"the":[38],"number":[39],"of":[40],"solutions":[41],"to":[42],"any":[43],"{0,1}-integer":[44],"program.":[45]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2019-08-22T00:00:00"}