{"id":"https://openalex.org/W2090871895","doi":"https://doi.org/10.1145/1806689.1806724","title":"On the complexity of circuit satisfiability","display_name":"On the complexity of circuit satisfiability","publication_year":2010,"publication_date":"2010-06-05","ids":{"openalex":"https://openalex.org/W2090871895","doi":"https://doi.org/10.1145/1806689.1806724","mag":"2090871895"},"language":"en","primary_location":{"id":"doi:10.1145/1806689.1806724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806724","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-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11104/0190940","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111512545","display_name":"Ramamohan Paturi","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramamohan Paturi","raw_affiliation_strings":["University of California, San Diego, La Jolla, CA, USA","University of California - San Diego, La Jolla, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California - San Diego, La Jolla, CA, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109848440","display_name":"Pavel Pudl\u00e1k","orcid":null},"institutions":[{"id":"https://openalex.org/I202391551","display_name":"Czech Academy of Sciences","ror":"https://ror.org/053avzc18","country_code":"CZ","type":"government","lineage":["https://openalex.org/I202391551"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Pavel Pudlak","raw_affiliation_strings":["Academy of Sciences of the Czech Republic, Praha, Czech Rep"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Academy of Sciences of the Czech Republic, Praha, Czech Rep","institution_ids":["https://openalex.org/I202391551"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.444,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.93234402,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"241","last_page":"250"},"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.9998000264167786,"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.9998000264167786,"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.9987000226974487,"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/T10142","display_name":"Formal Methods in Verification","score":0.9969000220298767,"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/satisfiability","display_name":"Satisfiability","score":0.7665570974349976},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.6626664400100708},{"id":"https://openalex.org/keywords/lemma","display_name":"Lemma (botany)","score":0.6211857199668884},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.5877106189727783},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5508381128311157},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5489485859870911},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.5309654474258423},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5046545267105103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.500739574432373},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.48829150199890137},{"id":"https://openalex.org/keywords/probabilistic-analysis-of-algorithms","display_name":"Probabilistic analysis of algorithms","score":0.479810506105423},{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.44157683849334717},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3839058578014374},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.380346417427063},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3715828061103821},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3684161603450775},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.24801376461982727},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.11541655659675598}],"concepts":[{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.7665570974349976},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6626664400100708},{"id":"https://openalex.org/C2777759810","wikidata":"https://www.wikidata.org/wiki/Q149316","display_name":"Lemma (botany)","level":3,"score":0.6211857199668884},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5877106189727783},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5508381128311157},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5489485859870911},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.5309654474258423},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5046545267105103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.500739574432373},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.48829150199890137},{"id":"https://openalex.org/C24404364","wikidata":"https://www.wikidata.org/wiki/Q7246846","display_name":"Probabilistic analysis of algorithms","level":3,"score":0.479810506105423},{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.44157683849334717},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3839058578014374},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.380346417427063},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3715828061103821},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3684161603450775},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.24801376461982727},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.11541655659675598},{"id":"https://openalex.org/C46757340","wikidata":"https://www.wikidata.org/wiki/Q43238","display_name":"Poaceae","level":2,"score":0.0},{"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},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1806689.1806724","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1806689.1806724","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-second ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0351120","is_oa":true,"landing_page_url":"http://hdl.handle.net/11104/0190940","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":{"id":"pmh:oai:asep.lib.cas.cz:CavUnEpca/0351120","is_oa":true,"landing_page_url":"http://hdl.handle.net/11104/0190940","pdf_url":null,"source":{"id":"https://openalex.org/S7407055266","display_name":"ASEP","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":"public-domain","license_id":"https://openalex.org/licenses/public-domain","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/conferenceObject"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W282603215","https://openalex.org/W1489355995","https://openalex.org/W1507717186","https://openalex.org/W1515598460","https://openalex.org/W1575411448","https://openalex.org/W1602078796","https://openalex.org/W1852383912","https://openalex.org/W1971483538","https://openalex.org/W1982687611","https://openalex.org/W1985572324","https://openalex.org/W1995725694","https://openalex.org/W2000956176","https://openalex.org/W2001224529","https://openalex.org/W2001868457","https://openalex.org/W2007200873","https://openalex.org/W2009384947","https://openalex.org/W2014430206","https://openalex.org/W2018964411","https://openalex.org/W2027049731","https://openalex.org/W2036185701","https://openalex.org/W2040996999","https://openalex.org/W2042654457","https://openalex.org/W2045326192","https://openalex.org/W2045717693","https://openalex.org/W2048685209","https://openalex.org/W2050689197","https://openalex.org/W2057512592","https://openalex.org/W2073025989","https://openalex.org/W2074359677","https://openalex.org/W2085938002","https://openalex.org/W2090190190","https://openalex.org/W2096833188","https://openalex.org/W2099474653","https://openalex.org/W2124240997","https://openalex.org/W2126442135","https://openalex.org/W2130190334","https://openalex.org/W2140270919","https://openalex.org/W2161678469","https://openalex.org/W2162561603","https://openalex.org/W2171680292","https://openalex.org/W3140964092","https://openalex.org/W4241017158"],"related_works":["https://openalex.org/W3176904788","https://openalex.org/W21597398","https://openalex.org/W4298153058","https://openalex.org/W2408080066","https://openalex.org/W2268872489","https://openalex.org/W1913543287","https://openalex.org/W2014111643","https://openalex.org/W2963044240","https://openalex.org/W2076399409","https://openalex.org/W2235115558"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3],"are":[4,55,154],"concerned":[5],"with":[6,19,41,142,159,172],"the":[7,11,20,27,58,79,97,103,107,124],"exponential":[8,21],"complexity":[9,22,83],"of":[10,23,38,50,60,105,110,156],"Circuit":[12],"Satisfiability":[13],"(CktSat)":[14],"problem":[15],"and":[16,92,178],"more":[17],"generally":[18],"NP-complete":[24,51],"problems.":[25,52],"Over":[26],"past":[28],"15":[29],"years":[30],"or":[31],"so,":[32],"researchers":[33],"have":[34],"obtained":[35],"a":[36,48,118],"number":[37],"exponential-time":[39],"algorithms":[40],"improved":[42],"running":[43],"times":[44],"for":[45,131,149],"exactly":[46],"solving":[47],"variety":[49],"The":[53],"improvements":[54],"typically":[56],"in":[57],"form":[59],"better":[61],"exponents":[62,80],"compared":[63],"to":[64,70,73],"exhaustive":[65],"search.":[66],"Our":[67,100,114],"goal":[68],"is":[69,117,163],"develop":[71],"techniques":[72],"prove":[74,93],"specific":[75],"lower":[76],"bounds":[77,95],"on":[78,96,151],"under":[81],"plausible":[82],"assumptions.":[84],"We":[85],"consider":[86],"natural,":[87],"though":[88],"restricted,":[89],"algorithmic":[90,112],"paradigms":[91],"upper":[94],"success":[98,119,143,179],"probability.":[99],"approach":[101],"has":[102],"advantage":[104],"clarifying":[106],"relative":[108],"power":[109],"various":[111],"paradigms.":[113],"main":[115],"technique":[116],"probability":[120,144,180],"amplification":[121],"technique,":[122],"called":[123],"Exponential":[125],"Amplification":[126],"Lemma,":[127],"which":[128,153],"shows":[129],"that":[130,139,169],"any":[132],"f(n,m)-size":[133],"bounded":[134],"probabilistic":[135,165],"circuit":[136,166],"family":[137,167],"A":[138],"decides":[140,170],"CktSat":[141,171],"at":[145],"least":[146],"2-\u03b1":[147,185],"n":[148,160,183],"\u03b1<1":[150],"inputs":[152],"circuits":[155],"size":[157,173],"m":[158],"variables,":[161],"there":[162],"another":[164],"B":[168],"roughly":[174],"f(\u03b1":[175],"n,":[176],"f(n,m))":[177],"about":[181],"2-\u03b12":[182],">":[184],"n.":[186]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}