{"id":"https://openalex.org/W2107998050","doi":"https://doi.org/10.1007/bf01272517","title":"On the power of small-depth threshold circuits","display_name":"On the power of small-depth threshold circuits","publication_year":1991,"publication_date":"1991-06-01","ids":{"openalex":"https://openalex.org/W2107998050","doi":"https://doi.org/10.1007/bf01272517","mag":"2107998050"},"language":"en","primary_location":{"id":"doi:10.1007/bf01272517","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01272517","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Complexity","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/A5113662691","display_name":"Johan H\ufffdstad","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Johan H\ufffdstad","raw_affiliation_strings":["Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089425353","display_name":"Mikael Goldmann","orcid":null},"institutions":[{"id":"https://openalex.org/I86987016","display_name":"KTH Royal Institute of Technology","ror":"https://ror.org/026vcq606","country_code":"SE","type":"education","lineage":["https://openalex.org/I86987016"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mikael Goldmann","raw_affiliation_strings":["Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44, Stockholm, SWEDEN","Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science, Royal Institute of Technology, S-100 44, Stockholm, SWEDEN","institution_ids":["https://openalex.org/I86987016"]},{"raw_affiliation_string":"Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm, Sweden","institution_ids":["https://openalex.org/I86987016"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I86987016"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":5.6461,"has_fulltext":false,"cited_by_count":255,"citation_normalized_percentile":{"value":0.97101633,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"1","issue":"2","first_page":"113","last_page":"129"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"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":1.0,"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.9973999857902527,"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.9966999888420105,"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/exponential-function","display_name":"Exponential function","score":0.7358778119087219},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.7165333032608032},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.7087583541870117},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5552552938461304},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.4730479121208191},{"id":"https://openalex.org/keywords/power","display_name":"Power (physics)","score":0.4679853916168213},{"id":"https://openalex.org/keywords/exponential-growth","display_name":"Exponential growth","score":0.43533363938331604},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4109785854816437},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38037341833114624},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3664380609989166},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.3640047013759613},{"id":"https://openalex.org/keywords/topology","display_name":"Topology (electrical circuits)","score":0.3446745276451111},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.2562059760093689},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.1549118459224701},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.1091637909412384},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08742323517799377}],"concepts":[{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.7358778119087219},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.7165333032608032},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.7087583541870117},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5552552938461304},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.4730479121208191},{"id":"https://openalex.org/C163258240","wikidata":"https://www.wikidata.org/wiki/Q25342","display_name":"Power (physics)","level":2,"score":0.4679853916168213},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.43533363938331604},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4109785854816437},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38037341833114624},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3664380609989166},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.3640047013759613},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.3446745276451111},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2562059760093689},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.1549118459224701},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.1091637909412384},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08742323517799377},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/bf01272517","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01272517","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computational Complexity","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":22,"referenced_works":["https://openalex.org/W592992621","https://openalex.org/W1970755596","https://openalex.org/W1986804393","https://openalex.org/W2009994177","https://openalex.org/W2011276482","https://openalex.org/W2012476164","https://openalex.org/W2014593388","https://openalex.org/W2015950107","https://openalex.org/W2017290750","https://openalex.org/W2025279645","https://openalex.org/W2029109849","https://openalex.org/W2036656440","https://openalex.org/W2045924252","https://openalex.org/W2060270693","https://openalex.org/W2070678975","https://openalex.org/W2086814302","https://openalex.org/W2097512637","https://openalex.org/W2114527013","https://openalex.org/W2116794057","https://openalex.org/W2130130502","https://openalex.org/W2151303208","https://openalex.org/W2151536080"],"related_works":["https://openalex.org/W1597080238","https://openalex.org/W2150974517","https://openalex.org/W2728195892","https://openalex.org/W2611822924","https://openalex.org/W2486254595","https://openalex.org/W3204916073","https://openalex.org/W1634993130","https://openalex.org/W2031906996","https://openalex.org/W1602624896","https://openalex.org/W1526667530"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":15},{"year":2018,"cited_by_count":16},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":16},{"year":2013,"cited_by_count":14},{"year":2012,"cited_by_count":16}],"updated_date":"2026-06-28T08:01:55.173337","created_date":"2025-10-10T00:00:00"}