{"id":"https://openalex.org/W2095012419","doi":"https://doi.org/10.1007/bf01200404","title":"On lower bounds for read-k-times branching programs","display_name":"On lower bounds for read-k-times branching programs","publication_year":1993,"publication_date":"1993-03-01","ids":{"openalex":"https://openalex.org/W2095012419","doi":"https://doi.org/10.1007/bf01200404","mag":"2095012419"},"language":"en","primary_location":{"id":"doi:10.1007/bf01200404","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200404","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/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":"A. Borodin","raw_affiliation_strings":["Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, CANADA","Department of Computer Science, University of Toronto, Toronto, CANADA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, CANADA","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, CANADA","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","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":false,"raw_author_name":"A. Razborov","raw_affiliation_strings":["Steklov Mathematical Institute, Vavilova 42, 117966, GSP-1, Moscow, RUSSIA","Steklov Mathematical Institute , Moscow , Russia"],"affiliations":[{"raw_affiliation_string":"Steklov Mathematical Institute, Vavilova 42, 117966, GSP-1, Moscow, RUSSIA","institution_ids":["https://openalex.org/I2801160905"]},{"raw_affiliation_string":"Steklov Mathematical Institute , Moscow , Russia","institution_ids":["https://openalex.org/I2801160905"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044935694","display_name":"Roman Smolensky","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":"R. Smolensky","raw_affiliation_strings":["Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, CANADA","Department of Computer Science, University of Toronto, Toronto, CANADA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Toronto, M5S 1A4, Toronto, Ontario, CANADA","institution_ids":["https://openalex.org/I185261750"]},{"raw_affiliation_string":"Department of Computer Science, University of Toronto, Toronto, CANADA","institution_ids":["https://openalex.org/I185261750"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5109583026"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":7.2974,"has_fulltext":false,"cited_by_count":129,"citation_normalized_percentile":{"value":0.9742523,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"3","issue":"1","first_page":"1","last_page":"18"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983000159263611,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973000288009644,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.996999979019165,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5459359288215637},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4805460572242737},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4649907946586609},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4607793390750885},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.40864959359169006},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3909617066383362}],"concepts":[{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5459359288215637},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4805460572242737},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4649907946586609},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4607793390750885},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40864959359169006},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3909617066383362},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/bf01200404","is_oa":false,"landing_page_url":"https://doi.org/10.1007/bf01200404","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.133.9194","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.133.9194","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mi.ras.ru/~razborov/nbp.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.394.895","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.394.895","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/lower-bounds-read-k-times-branching.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.2650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2650","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/nbp.ps","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Quality Education","id":"https://metadata.un.org/sdg/4"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W1505318022","https://openalex.org/W1517585663","https://openalex.org/W1524205832","https://openalex.org/W1528304975","https://openalex.org/W1547194982","https://openalex.org/W1587602953","https://openalex.org/W1895846869","https://openalex.org/W1976463987","https://openalex.org/W1982129592","https://openalex.org/W1989204408","https://openalex.org/W1999204069","https://openalex.org/W2004315837","https://openalex.org/W2009807436","https://openalex.org/W2031934066","https://openalex.org/W2038529163","https://openalex.org/W2043360684","https://openalex.org/W2048768180","https://openalex.org/W2053619330","https://openalex.org/W2056431243","https://openalex.org/W2069516228","https://openalex.org/W2079401865","https://openalex.org/W2080060305","https://openalex.org/W2086814302","https://openalex.org/W2099251677","https://openalex.org/W2157649851","https://openalex.org/W2561675875","https://openalex.org/W3183392806","https://openalex.org/W4210896998"],"related_works":["https://openalex.org/W1979597421","https://openalex.org/W2007980826","https://openalex.org/W2061531152","https://openalex.org/W3002753104","https://openalex.org/W2077600819","https://openalex.org/W2142036596","https://openalex.org/W2072657027","https://openalex.org/W2600246793","https://openalex.org/W4238204885","https://openalex.org/W2963966623"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}