{"id":"https://openalex.org/W2339207536","doi":"https://doi.org/10.1007/978-3-319-21398-9_17","title":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits","display_name":"Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2339207536","doi":"https://doi.org/10.1007/978-3-319-21398-9_17","mag":"2339207536"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-319-21398-9_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-21398-9_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://link.springer.com/chapter/10.1007%2F978-3-319-21398-9_17","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5082582375","display_name":"Ruiwen Chen","orcid":"https://orcid.org/0000-0002-8714-0043"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Ruiwen Chen","raw_affiliation_strings":["School of Informatics, University of Edinburgh, Edinburgh, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Informatics, University of Edinburgh, Edinburgh, UK","institution_ids":["https://openalex.org/I98677209"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066747130","display_name":"Valentine Kabanets","orcid":null},"institutions":[{"id":"https://openalex.org/I18014758","display_name":"Simon Fraser University","ror":"https://ror.org/0213rcc28","country_code":"CA","type":"education","lineage":["https://openalex.org/I18014758"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Valentine Kabanets","raw_affiliation_strings":["School of Computing Science, Simon Fraser University, Burnaby, BC, Canada"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing Science, Simon Fraser University, Burnaby, BC, Canada","institution_ids":["https://openalex.org/I18014758"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5082582375"],"corresponding_institution_ids":["https://openalex.org/I98677209"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.6617,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.8354805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"211","last_page":"222"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9965000152587891,"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/mathematics","display_name":"Mathematics","score":0.6439810991287231},{"id":"https://openalex.org/keywords/parity","display_name":"Parity (physics)","score":0.599063515663147},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5974833369255066},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.5879835486412048},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5791170597076416},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5633903741836548},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.560757040977478},{"id":"https://openalex.org/keywords/correlation","display_name":"Correlation","score":0.48480692505836487},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44928833842277527},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4163866341114044},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3970581591129303},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.20376181602478027},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.06445783376693726}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6439810991287231},{"id":"https://openalex.org/C2777151079","wikidata":"https://www.wikidata.org/wiki/Q141160","display_name":"Parity (physics)","level":2,"score":0.599063515663147},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5974833369255066},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.5879835486412048},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5791170597076416},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5633903741836548},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.560757040977478},{"id":"https://openalex.org/C117220453","wikidata":"https://www.wikidata.org/wiki/Q5172842","display_name":"Correlation","level":2,"score":0.48480692505836487},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44928833842277527},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4163866341114044},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3970581591129303},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.20376181602478027},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.06445783376693726},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C109214941","wikidata":"https://www.wikidata.org/wiki/Q18334","display_name":"Particle physics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-319-21398-9_17","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-319-21398-9_17","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.ed.ac.uk:publications/d1c4cd1f-402e-499e-8715-0e9faa6106f6","is_oa":true,"landing_page_url":"http://link.springer.com/chapter/10.1007%2F978-3-319-21398-9_17","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Chen, R & Kabanets, V 2015, Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. in Computing and Combinatorics : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9198, pp. 211-222. https://doi.org/10.1007/978-3-319-21398-9_17","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:publications/d1c4cd1f-402e-499e-8715-0e9faa6106f6","is_oa":true,"landing_page_url":"http://link.springer.com/chapter/10.1007%2F978-3-319-21398-9_17","pdf_url":null,"source":{"id":"https://openalex.org/S4306400321","display_name":"Edinburgh Research Explorer (University of Edinburgh)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98677209","host_organization_name":"University of Edinburgh","host_organization_lineage":["https://openalex.org/I98677209"],"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":"Chen, R & Kabanets, V 2015, Correlation Bounds and #SAT Algorithms for Small Linear-Size Circuits. in Computing and Combinatorics : 21st International Conference, COCOON 2015, Beijing, China, August 4-6, 2015, Proceedings. Lecture Notes in Computer Science, vol. 9198, pp. 211-222. https://doi.org/10.1007/978-3-319-21398-9_17","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W5136647","https://openalex.org/W1756918770","https://openalex.org/W1843179613","https://openalex.org/W1974632918","https://openalex.org/W1985314294","https://openalex.org/W2005223599","https://openalex.org/W2016590269","https://openalex.org/W2023412106","https://openalex.org/W2030586582","https://openalex.org/W2035917269","https://openalex.org/W2045924252","https://openalex.org/W2055097525","https://openalex.org/W2056017973","https://openalex.org/W2064339630","https://openalex.org/W2087370750","https://openalex.org/W2122780600","https://openalex.org/W2129969631","https://openalex.org/W2140707287","https://openalex.org/W2147052993","https://openalex.org/W2165293955","https://openalex.org/W2293895605","https://openalex.org/W2398060092","https://openalex.org/W2952496423","https://openalex.org/W4205582340"],"related_works":["https://openalex.org/W3212703233","https://openalex.org/W2728195892","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W1750931500","https://openalex.org/W3204916073","https://openalex.org/W2516690985","https://openalex.org/W2063425181","https://openalex.org/W2055594799","https://openalex.org/W2031906996"],"abstract_inverted_index":null,"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-09-01T08:31:24.195828","created_date":"2025-10-10T00:00:00"}