{"id":"https://openalex.org/W2571633443","doi":"https://doi.org/10.1145/3055399.3055430","title":"Time-space hardness of learning sparse parities","display_name":"Time-space hardness of learning sparse parities","publication_year":2017,"publication_date":"2017-06-15","ids":{"openalex":"https://openalex.org/W2571633443","doi":"https://doi.org/10.1145/3055399.3055430","mag":"2571633443"},"language":"en","primary_location":{"id":"doi:10.1145/3055399.3055430","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050781652","display_name":"Gillat Kol","orcid":"https://orcid.org/0009-0007-4725-6694"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Gillat Kol","raw_affiliation_strings":["Princeton University, USA","Princeton University, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, USA#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041545934","display_name":"Ran Raz","orcid":"https://orcid.org/0009-0008-1656-2258"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ran Raz","raw_affiliation_strings":["Princeton University, USA","Princeton University, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Princeton University, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University, USA#TAB#","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049425955","display_name":"Avishay Tal","orcid":"https://orcid.org/0000-0002-0375-6554"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Avishay Tal","raw_affiliation_strings":["IAS, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"IAS, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00283407,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"23","issue":null,"first_page":"1067","last_page":"1080"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"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"}},"topics":[{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.998199999332428,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9959999918937683,"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.9944999814033508,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/learning-with-errors","display_name":"Learning with errors","score":0.6500239372253418},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5903809666633606},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5734714865684509},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.5417843461036682},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5233190059661865},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.518714964389801},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.4986546039581299},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.47747159004211426},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.4583543837070465},{"id":"https://openalex.org/keywords/cryptography","display_name":"Cryptography","score":0.458196222782135},{"id":"https://openalex.org/keywords/encryption","display_name":"Encryption","score":0.44685959815979004},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4328215420246124},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.4249754250049591},{"id":"https://openalex.org/keywords/hamming-distance","display_name":"Hamming distance","score":0.42234688997268677},{"id":"https://openalex.org/keywords/hamming-space","display_name":"Hamming space","score":0.41509032249450684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2789420485496521},{"id":"https://openalex.org/keywords/hamming-code","display_name":"Hamming code","score":0.2769637703895569},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.22137141227722168},{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.09203043580055237}],"concepts":[{"id":"https://openalex.org/C2779014939","wikidata":"https://www.wikidata.org/wiki/Q6510239","display_name":"Learning with errors","level":3,"score":0.6500239372253418},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5903809666633606},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5734714865684509},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.5417843461036682},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5233190059661865},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.518714964389801},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.4986546039581299},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.47747159004211426},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.4583543837070465},{"id":"https://openalex.org/C178489894","wikidata":"https://www.wikidata.org/wiki/Q8789","display_name":"Cryptography","level":2,"score":0.458196222782135},{"id":"https://openalex.org/C148730421","wikidata":"https://www.wikidata.org/wiki/Q141090","display_name":"Encryption","level":2,"score":0.44685959815979004},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4328215420246124},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.4249754250049591},{"id":"https://openalex.org/C193319292","wikidata":"https://www.wikidata.org/wiki/Q272172","display_name":"Hamming distance","level":2,"score":0.42234688997268677},{"id":"https://openalex.org/C2779494224","wikidata":"https://www.wikidata.org/wiki/Q5645799","display_name":"Hamming space","level":5,"score":0.41509032249450684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2789420485496521},{"id":"https://openalex.org/C73150493","wikidata":"https://www.wikidata.org/wiki/Q853922","display_name":"Hamming code","level":4,"score":0.2769637703895569},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.22137141227722168},{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.09203043580055237},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0},{"id":"https://openalex.org/C157125643","wikidata":"https://www.wikidata.org/wiki/Q884707","display_name":"Block code","level":3,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3055399.3055430","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3055399.3055430","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"mag:2571633443","is_oa":false,"landing_page_url":"http://eccc.weizmann.ac.il/report/2016/113","pdf_url":null,"source":{"id":"https://openalex.org/S11189987","display_name":"Electronic colloquium on computational complexity","issn_l":"1433-8092","issn":["1433-8092"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Electronic colloquium on computational complexity","raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.6499999761581421,"id":"https://metadata.un.org/sdg/16"}],"awards":[{"id":"https://openalex.org/G1943969787","display_name":null,"funder_award_id":"CCF-1412958","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2433323164","display_name":null,"funder_award_id":"1402/14","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320306164","display_name":"Simons Foundation","ror":"https://ror.org/01cmst727"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320335016","display_name":"Israeli Centers for Research Excellence","ror":"https://ror.org/03w2v9593"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2019807548","https://openalex.org/W2104965768","https://openalex.org/W2133817484","https://openalex.org/W2163137752"],"related_works":["https://openalex.org/W2626222921","https://openalex.org/W2573646379","https://openalex.org/W2296201074","https://openalex.org/W3210904001","https://openalex.org/W2115652664","https://openalex.org/W2989308347","https://openalex.org/W2405010435","https://openalex.org/W2926230134","https://openalex.org/W1567930774","https://openalex.org/W1536382903","https://openalex.org/W2097286495","https://openalex.org/W2466376731","https://openalex.org/W2949636467","https://openalex.org/W2405211780","https://openalex.org/W2055143201","https://openalex.org/W2080975816","https://openalex.org/W2024697209","https://openalex.org/W2067378208","https://openalex.org/W2010796327","https://openalex.org/W3103511209"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,21,29],"concept":[3],"class":[4],"\u2131":[5,18],"to":[6],"be":[7],"time-space":[8],"hard":[9],"(or":[10],"memory-samples":[11],"hard)":[12],"if":[13],"any":[14],"learning":[15],"algorithm":[16],"for":[17],"requires":[19],"either":[20],"memory":[22],"of":[23,31,41],"size":[24],"super-linear":[25],"in":[26,34],"n":[27,37],"or":[28],"number":[30],"samples":[32],"super-polynomial":[33],"n,":[35],"where":[36],"is":[38],"the":[39],"length":[40],"one":[42],"sample.":[43]},"counts_by_year":[],"updated_date":"2026-07-30T17:31:21.811387","created_date":"2025-10-10T00:00:00"}