{"id":"https://openalex.org/W2020707942","doi":"https://doi.org/10.1137/0204027","title":"The Power of Negative Thinking in Multiplying Boolean Matrices","display_name":"The Power of Negative Thinking in Multiplying Boolean Matrices","publication_year":1975,"publication_date":"1975-09-01","ids":{"openalex":"https://openalex.org/W2020707942","doi":"https://doi.org/10.1137/0204027","mag":"2020707942"},"language":"en","primary_location":{"id":"doi:10.1137/0204027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204027","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/A5109845004","display_name":"Vaughan Pratt","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vaughan R. Pratt","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5109845004"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.1851,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.96897747,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"4","issue":"3","first_page":"326","last_page":"330"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9969000220298767,"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/T11567","display_name":"semigroups and automata theory","score":0.9958999752998352,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9952999949455261,"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.7618674039840698},{"id":"https://openalex.org/keywords/circuit-complexity","display_name":"Circuit complexity","score":0.6700738072395325},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.6416078805923462},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5760536193847656},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.5239705443382263},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.5227784514427185},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.48752376437187195},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.47038331627845764},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4689716100692749},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.45311084389686584},{"id":"https://openalex.org/keywords/parity-function","display_name":"Parity function","score":0.4327648878097534},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4303114712238312},{"id":"https://openalex.org/keywords/or-gate","display_name":"OR gate","score":0.4152371287345886},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4142634868621826},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.41100260615348816},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40361344814300537},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3726581335067749},{"id":"https://openalex.org/keywords/and-gate","display_name":"AND gate","score":0.31181105971336365},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.30118077993392944},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.18731510639190674},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.14449036121368408},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1090802550315857},{"id":"https://openalex.org/keywords/pure-mathematics","display_name":"Pure mathematics","score":0.09430155158042908},{"id":"https://openalex.org/keywords/quantum-mechanics","display_name":"Quantum mechanics","score":0.06952950358390808}],"concepts":[{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.7618674039840698},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.6700738072395325},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.6416078805923462},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5760536193847656},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.5239705443382263},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.5227784514427185},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.48752376437187195},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.47038331627845764},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4689716100692749},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.45311084389686584},{"id":"https://openalex.org/C188183281","wikidata":"https://www.wikidata.org/wiki/Q2898309","display_name":"Parity function","level":4,"score":0.4327648878097534},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4303114712238312},{"id":"https://openalex.org/C58140894","wikidata":"https://www.wikidata.org/wiki/Q560398","display_name":"OR gate","level":4,"score":0.4152371287345886},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4142634868621826},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.41100260615348816},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40361344814300537},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3726581335067749},{"id":"https://openalex.org/C10418432","wikidata":"https://www.wikidata.org/wiki/Q560370","display_name":"AND gate","level":3,"score":0.31181105971336365},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.30118077993392944},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.18731510639190674},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.14449036121368408},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1090802550315857},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.09430155158042908},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.06952950358390808},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"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":1,"locations":[{"id":"doi:10.1137/0204027","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0204027","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W2035476608","https://openalex.org/W2140232587"],"related_works":["https://openalex.org/W2234833091","https://openalex.org/W2037737738","https://openalex.org/W3204916073","https://openalex.org/W2055594799","https://openalex.org/W1930088680","https://openalex.org/W2011469629","https://openalex.org/W2611822924","https://openalex.org/W1564702418","https://openalex.org/W1597080238","https://openalex.org/W1976287608"],"abstract_inverted_index":{"We":[0],"show":[1],"that":[2,17],"$n^3":[3],"$":[4],"distinct":[5],"and-gate":[6],"inputs":[7],"appear":[8],"in":[9],"any":[10],"circuit":[11,38],"constructed":[12],"from":[13],"and-gates":[14],"and":[15,61],"or-gates":[16],"computes":[18],"the":[19],"product":[20],"of":[21],"two":[22],"$n":[23],"\\times":[24],"n$":[25],"Boolean":[26],"matrices.":[27],"Using":[28],"not-gates":[29],"as":[30],"well,":[31],"it":[32],"is":[33],"possible":[34],"to":[35],"realize":[36],"a":[37,54],"for":[39],"this":[40],"problem":[41],"using":[42],"only":[43],"$O(n^{\\log":[44],"_2":[45],"7}":[46],"\\log":[47],"^2":[48],"n)$":[49],"gates,":[50],"whence":[51],"we":[52],"infer":[53],"much":[55],"larger":[56],"complexity":[57],"gap":[58],"between":[59],"and-or":[60],"and-or-not":[62],"circuits":[63],"than":[64],"was":[65],"previously":[66],"known.":[67]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}