{"id":"https://openalex.org/W5136647","doi":"https://doi.org/10.1007/978-3-662-44465-8_15","title":"An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas","display_name":"An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas","publication_year":2014,"publication_date":"2014-01-01","ids":{"openalex":"https://openalex.org/W5136647","doi":"https://doi.org/10.1007/978-3-662-44465-8_15","mag":"5136647"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-662-44465-8_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_15","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":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://www.research.ed.ac.uk/en/publications/82a796db-48cd-47a9-863d-a7d93444c760","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/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":true,"raw_author_name":"Ruiwen Chen","raw_affiliation_strings":["Simon Fraser University, Burnaby, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"middle","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":["Simon Fraser University, Burnaby, Canada"],"affiliations":[{"raw_affiliation_string":"Simon Fraser University, Burnaby, Canada","institution_ids":["https://openalex.org/I18014758"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5034599141","display_name":"Nitin Saurabh","orcid":null},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Nitin Saurabh","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082582375"],"corresponding_institution_ids":["https://openalex.org/I18014758"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":6.1604,"has_fulltext":false,"cited_by_count":18,"citation_normalized_percentile":{"value":0.96762883,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"165","last_page":"176"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9987999796867371,"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/T12029","display_name":"DNA and Biological Computing","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9968000054359436,"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/mathematics","display_name":"Mathematics","score":0.7410268187522888},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5981712341308594},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5828189253807068},{"id":"https://openalex.org/keywords/constructive","display_name":"Constructive","score":0.5742588043212891},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4638727903366089},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.44937989115715027},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.42938101291656494},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.41913846135139465},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.41557571291923523},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3960985243320465},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.15974563360214233},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10872578620910645},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.061423689126968384}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7410268187522888},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5981712341308594},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5828189253807068},{"id":"https://openalex.org/C2778701210","wikidata":"https://www.wikidata.org/wiki/Q28130034","display_name":"Constructive","level":3,"score":0.5742588043212891},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4638727903366089},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.44937989115715027},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.42938101291656494},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.41913846135139465},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.41557571291923523},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3960985243320465},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.15974563360214233},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10872578620910645},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.061423689126968384},{"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/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-662-44465-8_15","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-662-44465-8_15","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:openaire/82a796db-48cd-47a9-863d-a7d93444c760","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/82a796db-48cd-47a9-863d-a7d93444c760","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, R, Kabanets, V & Saurabh, N 2014, An Improved Deterministic SAT Algorithm for Small De Morgan Formulas. in Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. vol. 8635, pp. 165-176. https://doi.org/10.1007/978-3-662-44465-8_15","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:pure.ed.ac.uk:publications/82a796db-48cd-47a9-863d-a7d93444c760","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11820/82a796db-48cd-47a9-863d-a7d93444c760","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 & Saurabh, N 2014, An Improved Deterministic SAT Algorithm for Small De Morgan Formulas. in Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. vol. 8635, pp. 165-176. https://doi.org/10.1007/978-3-662-44465-8_15","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"pmh:oai:pure.ed.ac.uk:openaire/82a796db-48cd-47a9-863d-a7d93444c760","is_oa":true,"landing_page_url":"https://www.research.ed.ac.uk/en/publications/82a796db-48cd-47a9-863d-a7d93444c760","pdf_url":null,"source":{"id":"https://openalex.org/S4406922455","display_name":"Edinburgh Research Explorer","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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chen, R, Kabanets, V & Saurabh, N 2014, An Improved Deterministic SAT Algorithm for Small De Morgan Formulas. in Mathematical Foundations of Computer Science 2014 : 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. vol. 8635, pp. 165-176. https://doi.org/10.1007/978-3-662-44465-8_15","raw_type":"contributionToPeriodical"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W282603215","https://openalex.org/W1974632918","https://openalex.org/W1985314294","https://openalex.org/W1991702990","https://openalex.org/W1999779303","https://openalex.org/W2005223599","https://openalex.org/W2007121506","https://openalex.org/W2016590269","https://openalex.org/W2030586582","https://openalex.org/W2055097525","https://openalex.org/W2102477571","https://openalex.org/W2106793914","https://openalex.org/W2129059686","https://openalex.org/W2129969631","https://openalex.org/W2140707287","https://openalex.org/W2165293955","https://openalex.org/W2229615128","https://openalex.org/W2396953629","https://openalex.org/W4205582340"],"related_works":["https://openalex.org/W1759995226","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W2952081610","https://openalex.org/W1983383464","https://openalex.org/W2089134982","https://openalex.org/W4390579151","https://openalex.org/W2113270940","https://openalex.org/W4252842032","https://openalex.org/W2521054645"],"abstract_inverted_index":null,"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":6},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":4}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}