{"id":"https://openalex.org/W2418282370","doi":"https://doi.org/10.1145/3349618","title":"Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials","display_name":"Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials","publication_year":2019,"publication_date":"2019-08-31","ids":{"openalex":"https://openalex.org/W2418282370","doi":"https://doi.org/10.1145/3349618","mag":"2418282370"},"language":"en","primary_location":{"id":"doi:10.1145/3349618","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3349618","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.71","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048942396","display_name":"Bart M. P. Jansen","orcid":"https://orcid.org/0000-0001-8204-1268"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Bart M. P. Jansen","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands","Eindhoven University of Technology"],"raw_orcid":"https://orcid.org/0000-0001-8204-1268","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047711767","display_name":"Astrid Pieterse","orcid":"https://orcid.org/0000-0003-3721-6721"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Astrid Pieterse","raw_affiliation_strings":["Eindhoven University of Technology, Eindhoven, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3721-6721","affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology, Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048942396"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.00274023,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"11","issue":"4","first_page":"1","last_page":"26"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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/T11567","display_name":"semigroups and automata theory","score":0.9990000128746033,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.7307402491569519},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6672484874725342},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6470728516578674},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.6394473910331726},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5936914086341858},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.573294460773468},{"id":"https://openalex.org/keywords/constraint-satisfaction-problem","display_name":"Constraint satisfaction problem","score":0.5691615343093872},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.527502179145813},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5165878534317017},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4863934814929962},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4836050570011139},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.42873597145080566},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.24370360374450684},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.14683163166046143},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10111171007156372}],"concepts":[{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.7307402491569519},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6672484874725342},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6470728516578674},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.6394473910331726},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5936914086341858},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.573294460773468},{"id":"https://openalex.org/C199622910","wikidata":"https://www.wikidata.org/wiki/Q1128326","display_name":"Constraint satisfaction problem","level":3,"score":0.5691615343093872},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.527502179145813},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5165878534317017},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4863934814929962},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4836050570011139},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.42873597145080566},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.24370360374450684},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.14683163166046143},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10111171007156372},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.0},{"id":"https://openalex.org/C24890656","wikidata":"https://www.wikidata.org/wiki/Q82811","display_name":"Acoustics","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":17,"locations":[{"id":"doi:10.1145/3349618","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3349618","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:drops-oai.dagstuhl.de:6482","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.71","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.tue.nl:openaire/3bb7026e-77bf-4b77-8580-462853dd9bf1","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/3bb7026e-77bf-4b77-8580-462853dd9bf1","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & Pieterse, A 2016, Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials. in P Faliszewski, A Muscholl & R Niedermeier (eds), 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), August 22-26, 2016, Krakow, Poland., 71, LIPICS (Leibniz International Proceedings in Informatics), vol. 58, Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik, Wadern, pp. 1-14, 41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), Krakow, Poland, 22/08/16. https://doi.org/10.4230/LIPIcs.MFCS.2016.71","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/e216797f-a4cd-46b8-8cb0-49e731c69138","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/e216797f-a4cd-46b8-8cb0-49e731c69138","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Jansen, B M P & Pieterse, A 2019, 'Optimal sparsification for some binary CSPs using low-degree polynomials', ACM Transactions on Computation Theory, vol. 11, no. 4, 28. https://doi.org/10.1145/3349618","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1606.03233","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1606.03233","pdf_url":"https://arxiv.org/pdf/1606.03233","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"","raw_type":null},{"id":"mag:2418282370","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1606.03233.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"arXiv (Cornell University)","raw_type":null},{"id":"pmh:916892","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=916892","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1942-3454","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:887215","is_oa":false,"landing_page_url":"http://repository.tue.nl/887215","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:916892","is_oa":false,"landing_page_url":"http://repository.tue.nl/916892","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:1942-3454","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:library.tue.nl:848785","is_oa":false,"landing_page_url":"http://repository.tue.nl/848785","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:tue:oai:library.tue.nl:856801","is_oa":false,"landing_page_url":"http://repository.tue.nl/856801","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:library.tue.nl:884505","is_oa":false,"landing_page_url":"http://repository.tue.nl/884505","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/other"},{"id":"pmh:tue:oai:pure.tue.nl:publications/3bb7026e-77bf-4b77-8580-462853dd9bf1","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/3bb7026e-77bf-4b77-8580-462853dd9bf1","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"41st International Symposium on Mathematical Foundations of Computer Science (MFCS 2016), August 22-26, 2016, Krakow, Poland, 1 - 14","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/7d5ae0cf-e31f-4017-8df7-210a0172ff46","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/7d5ae0cf-e31f-4017-8df7-210a0172ff46","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv. Cornell University Library","raw_type":"info:eu-repo/semantics/article"},{"id":"doi:10.48550/arxiv.1606.03233","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1606.03233","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":"article"},{"id":"doi:10.4230/lipics.mfcs.2016.71","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2016.71","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2988908508","is_oa":false,"landing_page_url":"https://pure.tue.nl/ws/files/50924722/optimal.pdf","pdf_url":null,"source":{"id":"https://openalex.org/S4306420488","display_name":"Mathematical Foundations of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Mathematical Foundations of Computer Science","raw_type":null}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:6482","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.MFCS.2016.71","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.4300000071525574}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321800","display_name":"Nederlandse Organisatie voor Wetenschappelijk Onderzoek","ror":"https://ror.org/04jsz6e67"},{"id":"https://openalex.org/F4320334164","display_name":"Simons Institute for the Theory of Computing, University of California Berkeley","ror":null}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W162452278","https://openalex.org/W172886310","https://openalex.org/W1490215229","https://openalex.org/W1544829330","https://openalex.org/W1556385097","https://openalex.org/W1821538950","https://openalex.org/W1909439116","https://openalex.org/W1975442866","https://openalex.org/W1976430052","https://openalex.org/W1995725694","https://openalex.org/W1998964055","https://openalex.org/W2034437384","https://openalex.org/W2039100365","https://openalex.org/W2052712469","https://openalex.org/W2054996571","https://openalex.org/W2097673562","https://openalex.org/W2116087731","https://openalex.org/W2117427564","https://openalex.org/W2118728198","https://openalex.org/W2147154704","https://openalex.org/W2149434153","https://openalex.org/W2158655916","https://openalex.org/W2166566648","https://openalex.org/W2241275978","https://openalex.org/W2253657605","https://openalex.org/W2294990651","https://openalex.org/W2295705054","https://openalex.org/W2478275166","https://openalex.org/W2540110070","https://openalex.org/W2569790754","https://openalex.org/W2659011796","https://openalex.org/W2763725654","https://openalex.org/W2972131259","https://openalex.org/W6690484361"],"related_works":["https://openalex.org/W2988908508","https://openalex.org/W2952089534","https://openalex.org/W2394551153","https://openalex.org/W1998964055","https://openalex.org/W2036139215","https://openalex.org/W21453999","https://openalex.org/W2951531405","https://openalex.org/W2115334306","https://openalex.org/W1699753700","https://openalex.org/W3005294169","https://openalex.org/W1987681136","https://openalex.org/W1983171306","https://openalex.org/W1615793053","https://openalex.org/W1885256053","https://openalex.org/W2951756435","https://openalex.org/W2574497079","https://openalex.org/W2345432430","https://openalex.org/W2888250735","https://openalex.org/W2092130624","https://openalex.org/W2912512664"],"abstract_inverted_index":{"This":[0],"article":[1],"analyzes":[2],"to":[3,9,59,87,129,180,187,196],"what":[4],"extent":[5],"it":[6,177],"is":[7,178],"possible":[8,179],"efficiently":[10,181],"reduce":[11,48,182,195],"the":[12,22,31,76,106,120,130,150,156,183],"number":[13,151,184],"of":[14,33,52,108,123,152,159,185],"clauses":[15],"in":[16,100,140],"NP-hard":[17],"satisfiability":[18],"problems":[19],"without":[20],"changing":[21],"answer.":[23],"Upper":[24],"and":[25,137],"lower":[26,138,144],"bounds":[27,139,145],"are":[28],"established":[29],"using":[30],"concept":[32],"kernelization.":[34],"Existing":[35],"results":[36,99],"show":[37,146],"that":[38,147],"if":[39],"NP":[40,213],"\u2288":[41],"coNP/poly,":[42],"no":[43,191],"efficient":[44],"preprocessing":[45],"algorithm":[46,193],"can":[47,194],"n":[49,65,91,188,203],"-variable":[50],"instances":[51,61],"cnf-sat":[53],"with":[54,62,110,173,200],"d":[55,66,92],"literals":[56],"per":[57],"clause":[58,175],"equivalent":[60,198],"O":[63,201],"(":[64,90,202],"\u2212\u03b5":[67],")":[68,94,205],"bits":[69,206],"for":[70,168,207],"any":[71,208],"\u03b5":[72,209],">":[73,210],"0.":[74],"For":[75,166],"N":[77],"ot":[78],"-A":[79],"ll":[80],"-E":[81],"qual":[82],"sat":[83],"problem,":[84],"a":[85,101,111],"compression":[86],"size":[88,158],"\u00d5":[89],"\u22121":[93],"exists.":[95],"We":[96,114],"put":[97],"these":[98],"common":[102],"framework":[103],"by":[104],"analyzing":[105],"compressibility":[107],"CSPs":[109],"binary":[112],"domain.":[113],"characterize":[115],"constraint":[116],"types":[117],"based":[118],"on":[119],"minimum":[121],"degree":[122],"multivariate":[124],"polynomials":[125],"whose":[126],"roots":[127],"correspond":[128],"satisfying":[131],"assignments,":[132],"obtaining":[133],"(nearly)":[134],"matching":[135],"upper":[136],"several":[141],"settings.":[142],"Our":[143],"not":[148],"just":[149],"constraints,":[153],"but":[154],"also":[155],"encoding":[157],"individual":[160],"constraints":[161,186],"plays":[162],"an":[163,197],"important":[164],"role.":[165],"example,":[167],"E":[169],"xact":[170],"S":[171],"atisfiability":[172],"unbounded":[174],"length":[176],"+1,":[189],"yet":[190],"polynomial-time":[192],"instance":[199],"2\u2212\u03b5":[204],"0,":[211],"unless":[212],"\u2286":[214],"coNP/poly.":[215]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-05-26T13:28:51.108037","created_date":"2025-10-10T00:00:00"}