{"id":"https://openalex.org/W2069191912","doi":"https://doi.org/10.1137/s0097539794275136","title":"On the Complexity of Negation-Limited Boolean Networks","display_name":"On the Complexity of Negation-Limited Boolean Networks","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2069191912","doi":"https://doi.org/10.1137/s0097539794275136","mag":"2069191912"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794275136","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794275136","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/A5113579141","display_name":"Robert Beals","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Robert Beals","raw_affiliation_strings":["Institute for Advanced Studies"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Studies","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110559347","display_name":"Tetsuro Nishino","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Tetsuro Nishino","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5061345083","display_name":"Keisuke Tanaka","orcid":"https://orcid.org/0000-0003-1330-4495"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Keisuke Tanaka","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5113579141"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":29,"citation_normalized_percentile":{"value":0.19965202,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"27","issue":"5","first_page":"1334","last_page":"1347"},"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.9987999796867371,"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.9975000023841858,"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/negation","display_name":"Negation","score":0.734595775604248},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7194919586181641},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.6162058115005493},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6122148036956787},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5940899848937988},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5148283839225769},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.5060555338859558},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.48822763562202454},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.47031107544898987},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4680468738079071},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4629754424095154},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.414274126291275},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1468174159526825},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.05493316054344177}],"concepts":[{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.734595775604248},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7194919586181641},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.6162058115005493},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6122148036956787},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5940899848937988},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5148283839225769},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.5060555338859558},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.48822763562202454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.47031107544898987},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4680468738079071},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4629754424095154},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.414274126291275},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1468174159526825},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.05493316054344177},{"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539794275136","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794275136","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:alma.01RUT_INST:11664831260004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/journalArticle/On-the-Complexity-of-Negation-Limited-Boolean/991031664288804646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"pmh:oai:t2r2.star.titech.ac.jp:00051480","is_oa":false,"landing_page_url":"http://t2r2.star.titech.ac.jp/cgi-bin/publicationinfo.cgi?q_publication_content_number=CTT100448467","pdf_url":null,"source":{"id":"https://openalex.org/S4377196385","display_name":"Tokyo Tech Research Repository (Tokyo Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I114531698","host_organization_name":"Tokyo Institute of Technology","host_organization_lineage":["https://openalex.org/I114531698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Journal Article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W205871068","https://openalex.org/W1517585663","https://openalex.org/W1533538517","https://openalex.org/W1609370892","https://openalex.org/W1966278576","https://openalex.org/W2008810674","https://openalex.org/W2012476164","https://openalex.org/W2038272454","https://openalex.org/W2043629999","https://openalex.org/W2044799855","https://openalex.org/W2054271696","https://openalex.org/W2054417980","https://openalex.org/W2119024968","https://openalex.org/W2129738196","https://openalex.org/W2141389982","https://openalex.org/W2152772468","https://openalex.org/W2398918824","https://openalex.org/W2532640196","https://openalex.org/W2913155685"],"related_works":["https://openalex.org/W2009341260","https://openalex.org/W3204916073","https://openalex.org/W2952185983","https://openalex.org/W2055594799","https://openalex.org/W2403507963","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W2799890067","https://openalex.org/W1492165320","https://openalex.org/W3046459465"],"abstract_inverted_index":{"A":[0,57],"theorem":[1],"of":[2,9,19,26,82,106,116,138,170,184],"Markov":[3],"precisely":[4],"determines":[5],"the":[6,97,104,108,168],"number":[7],"r":[8],"NEGATION":[10,40],"gates":[11,41],"necessary":[12],"and":[13,54,63,87,93,126],"sufficient":[14],"to":[15,100,110],"compute":[16],"a":[17,24,36,136,162,171],"system":[18,25],"boolean":[20,27],"functions":[21,28,146],"F.":[22],"For":[23],"on":[29],"n":[30],"variables,":[31],"$r\\leq":[32],"b(n)=\\lceil\\log_2(n+1)\\rceil$.":[33],"We":[34,43,112,133,160],"call":[35],"circuit":[37,49,58,98],"using":[38],"b(n)":[39],"negation-limited.":[42],"continue":[44],"recent":[45],"investigations":[46],"into":[47],"negation-limited":[48,80,114,158,172,186],"complexity,":[50],"giving":[51],"both":[52],"upper":[53],"lower":[55,154,165],"bounds.":[56],"with":[59,121],"inputs":[60],"x1,...,":[61],"xn":[62],"outputs":[64],"$\\neg":[65],"x_1,":[66],"\\ldots,":[67],"\\neg":[68],"x_n$":[69],"is":[70,131],"called":[71],"an":[72],"inverter,":[73],"for":[74,140,144,157,167,179],"which":[75],"$r=\\lceil\\log_2(n+1)\\rceil$.":[76],"Fischer":[77],"has":[78],"constructed":[79],"inverters":[81,115,187],"size":[83,99,117,169],"O(n2":[84],"log":[85,119],"n)":[86],"depth":[88,109,122],"O(log":[89,124],"n).":[90],"Recently,":[91],"Tanaka":[92],"Nishino":[94],"have":[95],"reduced":[96],"O(n":[101,118],"log2n)":[102],"at":[103],"expense":[105],"increasing":[107],"log2n.":[111],"construct":[113],"n),":[120,125],"only":[123],"we":[127,151,176],"conjecture":[128],"that":[129,178],"this":[130],"optimal.":[132],"also":[134],"improve":[135],"technique":[137],"Valiant":[139],"constructing":[141],"monotone":[142],"circuits":[143],"slice":[145],"(introduced":[147],"by":[148],"Berkowitz).":[149],"Next,":[150],"introduce":[152],"some":[153],"bound":[155,166],"techniques":[156],"circuits.":[159],"provide":[161],"5n+3":[163],"log(n+1)-c":[164],"inverter.":[173],"In":[174],"addition,":[175],"show":[177],"two":[180],"different":[181],"restricted":[182],"classes":[183],"circuit,":[185],"require":[188],"superlinear":[189],"size.":[190]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}