{"id":"https://openalex.org/W2799209096","doi":"https://doi.org/10.23919/date.2018.8342026","title":"Improving circuit size upper bounds using SAT-solvers","display_name":"Improving circuit size upper bounds using SAT-solvers","publication_year":2018,"publication_date":"2018-03-01","ids":{"openalex":"https://openalex.org/W2799209096","doi":"https://doi.org/10.23919/date.2018.8342026","mag":"2799209096"},"language":"en","primary_location":{"id":"doi:10.23919/date.2018.8342026","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2018.8342026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"},"type":"article","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/A5045174507","display_name":"Alexander S. Kulikov","orcid":"https://orcid.org/0000-0002-5656-0336"},"institutions":[{"id":"https://openalex.org/I2800906181","display_name":"St. Petersburg Department of Steklov Institute of Mathematics","ror":"https://ror.org/030h9s280","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2800906181","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander S. Kulikov","raw_affiliation_strings":["St. Petersburg Department, Steklov Institute of Mathematics"],"affiliations":[{"raw_affiliation_string":"St. Petersburg Department, Steklov Institute of Mathematics","institution_ids":["https://openalex.org/I2800906181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5045174507"],"corresponding_institution_ids":["https://openalex.org/I2800906181"],"apc_list":null,"apc_paid":null,"fwci":0.2106,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.50273271,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"1","issue":null,"first_page":"305","last_page":"308"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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.9984999895095825,"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.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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.7425661087036133},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7076917886734009},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7014864683151245},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.604417622089386},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4870813190937042},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.45255908370018005},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.429817795753479},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.42806947231292725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3700135350227356}],"concepts":[{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7425661087036133},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7076917886734009},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7014864683151245},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.604417622089386},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4870813190937042},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.45255908370018005},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.429817795753479},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.42806947231292725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3700135350227356},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/date.2018.8342026","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2018.8342026","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Design, Automation & Test in Europe Conference & Exhibition (DATE)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W203426248","https://openalex.org/W1526394790","https://openalex.org/W1957393600","https://openalex.org/W1989734466","https://openalex.org/W1998880364","https://openalex.org/W2009341260","https://openalex.org/W2068422506","https://openalex.org/W2146969125","https://openalex.org/W2296103289","https://openalex.org/W2482661504"],"related_works":["https://openalex.org/W1976822807","https://openalex.org/W2724189404","https://openalex.org/W2031906996","https://openalex.org/W3204916073","https://openalex.org/W2021985366","https://openalex.org/W2486254595","https://openalex.org/W2728195892","https://openalex.org/W1501085929","https://openalex.org/W4211064314","https://openalex.org/W2504025942"],"abstract_inverted_index":{"Boolean":[0,10],"circuits":[1,25,41],"is":[2,55],"arguably":[3],"the":[4,60],"most":[5],"natural":[6],"model":[7],"for":[8,15,38,42,73],"computing":[9],"functions.":[11],"Despite":[12],"intensive":[13],"research,":[14],"many":[16],"functions,":[17],"we":[18,31,76],"still":[19],"do":[20],"not":[21],"know":[22],"what":[23,63,74],"optimal":[24,40],"look":[26],"like.":[27],"In":[28],"this":[29,53],"paper,":[30],"discuss":[32,51],"how":[33],"SAT-solvers":[34],"can":[35,64],"be":[36,67],"used":[37],"constructing":[39],"functions":[43,75],"on":[44],"moderate":[45],"number":[46],"of":[47],"variables.":[48],"We":[49],"first":[50],"why":[52],"problem":[54],"important":[56],"and":[57,65,72],"then":[58],"indicate":[59],"current":[61],"frontiers:":[62],"cannot":[66],"found":[68],"by":[69],"state-of-the-art":[70],"SAT-solvers,":[71],"are":[77],"interested":[78],"in":[79],"finding":[80],"efficient":[81],"circuits.":[82]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}