{"id":"https://openalex.org/W2143383751","doi":"https://doi.org/10.1016/s0020-0190(03)00255-2","title":"Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor","display_name":"Reduced Error Pruning of branching programs cannot be approximated to within a logarithmic factor","publication_year":2003,"publication_date":"2003-05-19","ids":{"openalex":"https://openalex.org/W2143383751","doi":"https://doi.org/10.1016/s0020-0190(03)00255-2","mag":"2143383751"},"language":"en","primary_location":{"id":"doi:10.1016/s0020-0190(03)00255-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00255-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","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/A5082414223","display_name":"Richard Nock","orcid":"https://orcid.org/0000-0001-8384-9621"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Richard Nock","raw_affiliation_strings":["D\u00e9partement Scientifique Interfacultaire, Universit\u00e9 des Antilles-Guyane, Campus de Schoelcher, BP 7209, 97275 Schoelcher, Martinique, France"],"affiliations":[{"raw_affiliation_string":"D\u00e9partement Scientifique Interfacultaire, Universit\u00e9 des Antilles-Guyane, Campus de Schoelcher, BP 7209, 97275 Schoelcher, Martinique, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5077281461","display_name":"Tapio Elomaa","orcid":"https://orcid.org/0000-0002-5230-0027"},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Tapio Elomaa","raw_affiliation_strings":["Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland","Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN\u201000014 University of Helsinki, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN\u201000014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039883146","display_name":"Matti K\u00e4\u00e4ri\u00e4inen","orcid":null},"institutions":[{"id":"https://openalex.org/I133731052","display_name":"University of Helsinki","ror":"https://ror.org/040af2s02","country_code":"FI","type":"education","lineage":["https://openalex.org/I133731052"]}],"countries":["FI"],"is_corresponding":false,"raw_author_name":"Matti K\u00e4\u00e4ri\u00e4inen","raw_affiliation_strings":["Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland","Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN\u201000014 University of Helsinki, Finland"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN-00014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]},{"raw_affiliation_string":"Department of Computer Science, P.O. Box 26 (Teollisuuskatu 23), FIN\u201000014 University of Helsinki, Finland","institution_ids":["https://openalex.org/I133731052"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5082414223"],"corresponding_institution_ids":[],"apc_list":{"value":2200,"currency":"USD","value_usd":2200},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.21084916,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"87","issue":"2","first_page":"73","last_page":"78"},"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.9998999834060669,"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.9998999834060669,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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/T10237","display_name":"Cryptography and Data Security","score":0.9958999752998352,"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/pruning","display_name":"Pruning","score":0.7680569887161255},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7633769512176514},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7143087387084961},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.6242836713790894},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5519605278968811},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.47482332587242126},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.46548572182655334},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4607592225074768},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45588740706443787},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4380181133747101},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4363192319869995},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.31974440813064575},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23149800300598145}],"concepts":[{"id":"https://openalex.org/C108010975","wikidata":"https://www.wikidata.org/wiki/Q500094","display_name":"Pruning","level":2,"score":0.7680569887161255},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7633769512176514},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7143087387084961},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.6242836713790894},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5519605278968811},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.47482332587242126},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.46548572182655334},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4607592225074768},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45588740706443787},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4380181133747101},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4363192319869995},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31974440813064575},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23149800300598145},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C6557445","wikidata":"https://www.wikidata.org/wiki/Q173113","display_name":"Agronomy","level":1,"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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":2,"locations":[{"id":"doi:10.1016/s0020-0190(03)00255-2","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0020-0190(03)00255-2","pdf_url":null,"source":{"id":"https://openalex.org/S147953040","display_name":"Information Processing Letters","issn_l":"0020-0190","issn":["0020-0190","1872-6119"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Information Processing Letters","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.58.6048","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.6048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.univ-ag.fr/~rnock/Articles/Drafts/ipl03-nek.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1520252399","https://openalex.org/W1539246860","https://openalex.org/W1594031697","https://openalex.org/W1648786085","https://openalex.org/W1999032440","https://openalex.org/W2003866851","https://openalex.org/W2008599531","https://openalex.org/W2011039300","https://openalex.org/W2038922054","https://openalex.org/W2048714276","https://openalex.org/W2066747232","https://openalex.org/W2109039359","https://openalex.org/W2125055259","https://openalex.org/W2128420091","https://openalex.org/W2143996311","https://openalex.org/W2330820318","https://openalex.org/W2912483566","https://openalex.org/W2913668833","https://openalex.org/W3085162807","https://openalex.org/W6632224395","https://openalex.org/W6652754609","https://openalex.org/W6660282588","https://openalex.org/W6667676166"],"related_works":["https://openalex.org/W2004283824","https://openalex.org/W2113270940","https://openalex.org/W1581210843","https://openalex.org/W1998702677","https://openalex.org/W1992104669","https://openalex.org/W1982530285","https://openalex.org/W2521054645","https://openalex.org/W1830048115","https://openalex.org/W2515993118","https://openalex.org/W1524136787"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}