{"id":"https://openalex.org/W1524205832","doi":"https://doi.org/10.1007/3-540-54458-5_49","title":"Lower bounds for deterministic and nondeterministic branching programs","display_name":"Lower bounds for deterministic and nondeterministic branching programs","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W1524205832","doi":"https://doi.org/10.1007/3-540-54458-5_49","mag":"1524205832"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-54458-5_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54458-5_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5008113826","display_name":"Alexander Razborov","orcid":null},"institutions":[{"id":"https://openalex.org/I2801160905","display_name":"Steklov Mathematical Institute","ror":"https://ror.org/03zeg8w71","country_code":"RU","type":"facility","lineage":["https://openalex.org/I1313323035","https://openalex.org/I2801160905","https://openalex.org/I4210124601"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Alexander A. Razborov","raw_affiliation_strings":["Steklov Mathematical Institute, Vavilova 42, 117966, GSP-1, Moscow, USSR","Steklov Mathematical Institute,"],"affiliations":[{"raw_affiliation_string":"Steklov Mathematical Institute, Vavilova 42, 117966, GSP-1, Moscow, USSR","institution_ids":["https://openalex.org/I2801160905"]},{"raw_affiliation_string":"Steklov Mathematical Institute,","institution_ids":["https://openalex.org/I2801160905"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5008113826"],"corresponding_institution_ids":["https://openalex.org/I2801160905"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.5079,"has_fulltext":false,"cited_by_count":107,"citation_normalized_percentile":{"value":0.92341494,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"47","last_page":"60"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.998199999332428,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.9376929998397827},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7462038397789001},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6714516282081604},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.6657000780105591},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.6174046993255615},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5907045006752014},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.44954273104667664},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3723371624946594},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3675262928009033},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28035253286361694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16718006134033203}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.9376929998397827},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7462038397789001},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6714516282081604},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.6657000780105591},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.6174046993255615},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5907045006752014},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.44954273104667664},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3723371624946594},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3675262928009033},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28035253286361694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16718006134033203},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/3-540-54458-5_49","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-54458-5_49","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.3.7121","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.7121","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://genesis.mi.ras.ru/~razborov/fct.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.380.7884","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.380.7884","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://people.cs.uchicago.edu/~razborov/files/fct.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5699999928474426,"display_name":"Reduced inequalities","id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W109768277","https://openalex.org/W112636843","https://openalex.org/W183465075","https://openalex.org/W378983080","https://openalex.org/W592992621","https://openalex.org/W1505318022","https://openalex.org/W1517585663","https://openalex.org/W1575886793","https://openalex.org/W1587602953","https://openalex.org/W1591764802","https://openalex.org/W1963927532","https://openalex.org/W1966722307","https://openalex.org/W1975470561","https://openalex.org/W1976463987","https://openalex.org/W1988434454","https://openalex.org/W2002089154","https://openalex.org/W2005938320","https://openalex.org/W2006787007","https://openalex.org/W2008470071","https://openalex.org/W2038529163","https://openalex.org/W2053619330","https://openalex.org/W2068422506","https://openalex.org/W2069516228","https://openalex.org/W2070913436","https://openalex.org/W2076458424","https://openalex.org/W2079401865","https://openalex.org/W2086814302","https://openalex.org/W2091062315","https://openalex.org/W2104952158","https://openalex.org/W2128428740","https://openalex.org/W2138170131","https://openalex.org/W2156184725","https://openalex.org/W2157649851","https://openalex.org/W2162199822","https://openalex.org/W2213409224","https://openalex.org/W2296545821","https://openalex.org/W2335502549","https://openalex.org/W2561675875","https://openalex.org/W3141130043","https://openalex.org/W4285719527","https://openalex.org/W4302339081","https://openalex.org/W6674245874"],"related_works":["https://openalex.org/W184826316","https://openalex.org/W3132573772","https://openalex.org/W1576777252","https://openalex.org/W3161879573","https://openalex.org/W2102187481","https://openalex.org/W2497444493","https://openalex.org/W1554633336","https://openalex.org/W2740150023","https://openalex.org/W1484421137","https://openalex.org/W3212703233"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":7},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}