{"id":"https://openalex.org/W2071260871","doi":"https://doi.org/10.1137/0218038","title":"Two Applications of Inductive Counting for Complementation Problems","display_name":"Two Applications of Inductive Counting for Complementation Problems","publication_year":1989,"publication_date":"1989-06-01","ids":{"openalex":"https://openalex.org/W2071260871","doi":"https://doi.org/10.1137/0218038","mag":"2071260871"},"language":"en","primary_location":{"id":"doi:10.1137/0218038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218038","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5109583026","display_name":"Allan Borodin","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Allan Borodin","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Stephen A. Cook","raw_affiliation_strings":["University of Toronto, Toronto, Canada"],"affiliations":[{"raw_affiliation_string":"University of Toronto, Toronto, Canada","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031636382","display_name":"Patrick Dymond","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":"Patrick W. Dymond","raw_affiliation_strings":["University of California at San Diego, La Jolla"],"affiliations":[{"raw_affiliation_string":"University of California at San Diego, La Jolla","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086685720","display_name":"Walter L. Ruzzo","orcid":"https://orcid.org/0000-0002-6260-2926"},"institutions":[{"id":"https://openalex.org/I201448701","display_name":"University of Washington","ror":"https://ror.org/00cvxb145","country_code":"US","type":"education","lineage":["https://openalex.org/I201448701"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Walter L. Ruzzo","raw_affiliation_strings":["University Of Washington (Seattle, WA)"],"affiliations":[{"raw_affiliation_string":"University Of Washington (Seattle, WA)","institution_ids":["https://openalex.org/I201448701"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008676408","display_name":"Martin Tompa","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin Tompa","raw_affiliation_strings":["IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#"],"affiliations":[{"raw_affiliation_string":"IBM Thomas J. Watson Research Center Yorktown Heights, NY#TAB#","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5109583026"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":8.1406,"has_fulltext":false,"cited_by_count":135,"citation_normalized_percentile":{"value":0.98449723,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"18","issue":"3","first_page":"559","last_page":"578"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9979000091552734,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.817933201789856},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.6466798782348633},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.605246365070343},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5748306512832642},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.571191132068634},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5289718508720398},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.515661358833313},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.4598378539085388},{"id":"https://openalex.org/keywords/closure","display_name":"Closure (psychology)","score":0.4574716091156006},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.44357478618621826},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.42171788215637207},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3415353298187256},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.21937492489814758},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1722758710384369}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.817933201789856},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.6466798782348633},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.605246365070343},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5748306512832642},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.571191132068634},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5289718508720398},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.515661358833313},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.4598378539085388},{"id":"https://openalex.org/C146834321","wikidata":"https://www.wikidata.org/wiki/Q2979672","display_name":"Closure (psychology)","level":2,"score":0.4574716091156006},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.44357478618621826},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.42171788215637207},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3415353298187256},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.21937492489814758},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1722758710384369},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0218038","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0218038","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.1662","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.1662","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.toronto.edu/~bor/Papers/two-applications-complementation-via-inductive-counting.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1572259068","display_name":"Complexity Theory and Parallel Computation","funder_award_id":"8604031","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4642530996","display_name":"Parallel Algorithms and Complexity Theory","funder_award_id":"8703196","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W93326723","https://openalex.org/W190044327","https://openalex.org/W344542471","https://openalex.org/W1504384894","https://openalex.org/W1570445666","https://openalex.org/W1585406291","https://openalex.org/W1587590810","https://openalex.org/W1594498656","https://openalex.org/W1886600493","https://openalex.org/W1965022641","https://openalex.org/W1968785579","https://openalex.org/W1973023438","https://openalex.org/W1979328074","https://openalex.org/W1982129592","https://openalex.org/W1982347904","https://openalex.org/W1984581643","https://openalex.org/W1987856263","https://openalex.org/W2004618348","https://openalex.org/W2007572995","https://openalex.org/W2008470071","https://openalex.org/W2012539169","https://openalex.org/W2017205387","https://openalex.org/W2021452188","https://openalex.org/W2023336906","https://openalex.org/W2039302045","https://openalex.org/W2043360684","https://openalex.org/W2056099894","https://openalex.org/W2058868103","https://openalex.org/W2059442002","https://openalex.org/W2079275582","https://openalex.org/W2104734478","https://openalex.org/W2156184725","https://openalex.org/W2293273465","https://openalex.org/W3016266344","https://openalex.org/W4212805448","https://openalex.org/W4241108585"],"related_works":["https://openalex.org/W2085484366","https://openalex.org/W1486286946","https://openalex.org/W2122747219","https://openalex.org/W2146459129","https://openalex.org/W2950065312","https://openalex.org/W278676640","https://openalex.org/W2591371812","https://openalex.org/W4302414675","https://openalex.org/W2482914130","https://openalex.org/W1676587966"],"abstract_inverted_index":{"Following":[0],"the":[1,39,51,74],"recent":[2],"independent":[3],"proofs":[4],"of":[5,38,87,96,124],"Immerman":[6],"[SIAM":[7],"J.":[8],"Comput.,":[9],"17":[10],"(1988),":[11],"pp.":[12,24],"935\u2013938]":[13],"and":[14,63],"Szelepcsenyi":[15],"[Bull.":[16],"European":[17],"Assoc.":[18],"Theoret.":[19],"Comput.":[20],"Sci.,":[21],"33":[22],"(1987),":[23],"96\u2013100]":[25],"that":[26,57,73,91,121],"nondeterministic":[27,105],"space-bounded":[28],"complexity":[29],"classes":[30,97],"are":[31,43],"closed":[32,78],"under":[33,79,94],"complementation,":[34],"two":[35],"further":[36],"applications":[37],"inductive":[40],"counting":[41],"technique":[42],"developed.":[44],"First,":[45],"an":[46],"errorless":[47],"probabilistic":[48],"algorithm":[49],"for":[50],"undirected":[52],"graph":[53],"s-t":[54],"connectivity":[55],"problem":[56],"runs":[58],"in":[59,127],"$O(\\log":[60],"n)$":[61],"space":[62],"polynomial":[64],"expected":[65],"time":[66],"is":[67,71,77,83,119],"given.":[68],"Then":[69],"it":[70,118],"shown":[72,120],"class":[75],"LOGCFL":[76],"complementation.":[80],"The":[81],"latter":[82],"a":[84,88],"special":[85],"case":[86],"general":[89],"result":[90],"shows":[92],"closure":[93],"complementation":[95],"defined":[98],"by":[99],"semi-unbounded":[100],"fan-in":[101],"circuits":[102],"(or,":[103],"equivalently,":[104],"auxiliary":[106],"pushdown":[107],"automata":[108],"or":[109],"tree-size":[110],"bounded":[111],"alternating":[112],"Turing":[113],"machines).":[114],"As":[115],"one":[116],"consequence,":[117],"small":[122],"numbers":[123],"\u201crole":[125],"switches\u201d":[126],"two-person":[128],"pebbling":[129],"can":[130],"be":[131],"eliminated.":[132]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}