{"id":"https://openalex.org/W1585188551","doi":"https://doi.org/10.1145/1536414.1536458","title":"Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems","display_name":"Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W1585188551","doi":"https://doi.org/10.1145/1536414.1536458","mag":"1585188551"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0811.3244","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5108090276","display_name":"Marek Karpi\u0144ski","orcid":null},"institutions":[{"id":"https://openalex.org/I135140700","display_name":"University of Bonn","ror":"https://ror.org/041nas322","country_code":"DE","type":"education","lineage":["https://openalex.org/I135140700"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marek Karpinski","raw_affiliation_strings":["University of Bonn, Bonn, Germany","\u2021University of Bonn, Bonn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]},{"raw_affiliation_string":"\u2021University of Bonn, Bonn, Germany","institution_ids":["https://openalex.org/I135140700"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079220724","display_name":"Warren Schudy","orcid":null},"institutions":[{"id":"https://openalex.org/I27804330","display_name":"Brown University","ror":"https://ror.org/05gq02987","country_code":"US","type":"education","lineage":["https://openalex.org/I27804330"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Warren Schudy","raw_affiliation_strings":["Brown University, Providence, RI, USA","Brown University Providence RI USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Brown University, Providence, RI, USA","institution_ids":["https://openalex.org/I27804330"]},{"raw_affiliation_string":"Brown University Providence RI USA","institution_ids":["https://openalex.org/I27804330"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.05131894,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"15","issue":null,"first_page":"313","last_page":"322"},"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9991000294685364,"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/T11716","display_name":"Random Matrices and Applications","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/decoding-methods","display_name":"Decoding methods","score":0.5283461809158325},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.473433256149292},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4625282883644104},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4601292312145233},{"id":"https://openalex.org/keywords/code-word","display_name":"Code word","score":0.450738787651062},{"id":"https://openalex.org/keywords/minification","display_name":"Minification","score":0.44299063086509705},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43467336893081665},{"id":"https://openalex.org/keywords/polynomial-time-approximation-scheme","display_name":"Polynomial-time approximation scheme","score":0.42890721559524536},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4278647303581238},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.40423229336738586},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3868064284324646},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34198373556137085},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08975306153297424}],"concepts":[{"id":"https://openalex.org/C57273362","wikidata":"https://www.wikidata.org/wiki/Q576722","display_name":"Decoding methods","level":2,"score":0.5283461809158325},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.473433256149292},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4625282883644104},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4601292312145233},{"id":"https://openalex.org/C153207627","wikidata":"https://www.wikidata.org/wiki/Q863873","display_name":"Code word","level":3,"score":0.450738787651062},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.44299063086509705},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43467336893081665},{"id":"https://openalex.org/C99140742","wikidata":"https://www.wikidata.org/wiki/Q843550","display_name":"Polynomial-time approximation scheme","level":3,"score":0.42890721559524536},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4278647303581238},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.40423229336738586},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3868064284324646},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34198373556137085},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08975306153297424},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1145/1536414.1536458","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536458","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:0811.3244","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.3244","pdf_url":"https://arxiv.org/pdf/0811.3244","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.9667","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9667","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.cs.uni-bonn.de/~marek/publications/min.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.247.4099","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.247.4099","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/0811.3244v1.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.429.4133","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.429.4133","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://eccc.hpi-web.de/report/2008/101/download/","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.591.7768","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.591.7768","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.microsoft.com/pubs/74260/min.pdf","raw_type":"text"},{"id":"doi:10.48550/arxiv.0811.3244","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.0811.3244","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"},{"id":"mag:1585188551","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/journals/eccc/eccc15.html#KarpinskiS08","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":{"id":"pmh:oai:arXiv.org:0811.3244","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0811.3244","pdf_url":"https://arxiv.org/pdf/0811.3244","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1585188551.pdf","grobid_xml":"https://content.openalex.org/works/W1585188551.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W1511716344","https://openalex.org/W1518498106","https://openalex.org/W1519375772","https://openalex.org/W1976779334","https://openalex.org/W1998058722","https://openalex.org/W2014323766","https://openalex.org/W2016232593","https://openalex.org/W2027048490","https://openalex.org/W2051564361","https://openalex.org/W2052664069","https://openalex.org/W2066979869","https://openalex.org/W2072858942","https://openalex.org/W2074844420","https://openalex.org/W2082349572","https://openalex.org/W2114519943","https://openalex.org/W2124577064","https://openalex.org/W2132302072","https://openalex.org/W2141072246","https://openalex.org/W2157678969","https://openalex.org/W2165292791","https://openalex.org/W2964478421","https://openalex.org/W3014312596","https://openalex.org/W3036999547","https://openalex.org/W3144422206"],"related_works":["https://openalex.org/W2951012962","https://openalex.org/W197042591","https://openalex.org/W2963232841","https://openalex.org/W2027914929","https://openalex.org/W2288190495","https://openalex.org/W2612785923","https://openalex.org/W1986996840","https://openalex.org/W1571530710","https://openalex.org/W3098889536","https://openalex.org/W1488906711","https://openalex.org/W3047066292","https://openalex.org/W2962719003","https://openalex.org/W1605184177","https://openalex.org/W2939149922","https://openalex.org/W2125028780","https://openalex.org/W3128731393","https://openalex.org/W2127872150","https://openalex.org/W2407372716","https://openalex.org/W2791155569","https://openalex.org/W2887990573"],"abstract_inverted_index":{"We":[0],"design":[1],"a":[2,16,41,74,87],"linear":[3,66],"time":[4,67],"approximation":[5,68],"scheme":[6],"for":[7,70,90],"the":[8,25,64],"Gale-Berlekamp":[9],"Switching":[10],"Game":[11],"and":[12,30,47,79,100],"generalize":[13],"it":[14],"to":[15],"wider":[17],"class":[18],"of":[19,44,51,59,77,97,103],"dense":[20],"fragile":[21],"minimization":[22],"problems":[23,99],"including":[24],"Nearest":[26],"Codeword":[27],"Problem":[28],"(NCP)":[29],"Unique":[31],"Games":[32],"Problem.":[33],"Further":[34],"applications":[35],"include,":[36],"among":[37],"other":[38],"things,":[39],"finding":[40],"constrained":[42],"form":[43],"matrix":[45],"rigidity":[46],"maximum":[48],"likelihood":[49],"decoding":[50],"an":[52],"error":[53],"correcting":[54],"code.":[55],"As":[56],"another":[57],"application":[58],"our":[60],"method":[61],"we":[62],"give":[63],"first":[65],"schemes":[69],"correlation":[71],"clustering":[72],"with":[73,92],"fixed":[75],"number":[76],"clusters":[78],"its":[80],"hierarchical":[81],"generalization.":[82],"Our":[83],"results":[84],"depend":[85],"on":[86],"new":[88],"technique":[89],"dealing":[91],"small":[93],"objective":[94],"function":[95],"values":[96],"optimization":[98],"could":[101],"be":[102],"independent":[104],"interest.":[105]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}