{"id":"https://openalex.org/W2153575169","doi":"https://doi.org/10.1007/s00037-009-0260-x","title":"On Defining Integers And Proving Arithmetic Circuit Lower Bounds","display_name":"On Defining Integers And Proving Arithmetic Circuit Lower Bounds","publication_year":2009,"publication_date":"2009-04-01","ids":{"openalex":"https://openalex.org/W2153575169","doi":"https://doi.org/10.1007/s00037-009-0260-x","mag":"2153575169"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-009-0260-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-009-0260-x","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/A5029244957","display_name":"Peter B\u00fcrgisser","orcid":"https://orcid.org/0000-0001-8169-0514"},"institutions":[{"id":"https://openalex.org/I206945453","display_name":"Paderborn University","ror":"https://ror.org/058kzsd48","country_code":"DE","type":"education","lineage":["https://openalex.org/I206945453"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Peter B\u00fcrgisser","raw_affiliation_strings":["Institute of Mathematics, University of Paderborn, D-33095, Paderborn, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Institute of Mathematics, University of Paderborn, D-33095, Paderborn, Germany","institution_ids":["https://openalex.org/I206945453"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5029244957"],"corresponding_institution_ids":["https://openalex.org/I206945453"],"apc_list":{"value":2890,"currency":"USD","value_usd":2890},"apc_paid":null,"fwci":4.1768,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.94216492,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"18","issue":"1","first_page":"81","last_page":"103"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/T11130","display_name":"Coding theory and cryptography","score":0.9994000196456909,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9991999864578247,"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.9986000061035156,"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/mathematics","display_name":"Mathematics","score":0.8103927373886108},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.6971834301948547},{"id":"https://openalex.org/keywords/arithmetic-circuit-complexity","display_name":"Arithmetic circuit complexity","score":0.6744243502616882},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6305407285690308},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.6246070861816406},{"id":"https://openalex.org/keywords/algebraic-number","display_name":"Algebraic number","score":0.5932261347770691},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.535452127456665},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5185930728912354},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.4738462567329407},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4620923399925232},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4582372009754181},{"id":"https://openalex.org/keywords/arbitrary-precision-arithmetic","display_name":"Arbitrary-precision arithmetic","score":0.3137742877006531}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8103927373886108},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.6971834301948547},{"id":"https://openalex.org/C155920423","wikidata":"https://www.wikidata.org/wiki/Q4791120","display_name":"Arithmetic circuit complexity","level":3,"score":0.6744243502616882},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6305407285690308},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.6246070861816406},{"id":"https://openalex.org/C9376300","wikidata":"https://www.wikidata.org/wiki/Q168817","display_name":"Algebraic number","level":2,"score":0.5932261347770691},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.535452127456665},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5185930728912354},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.4738462567329407},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4620923399925232},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4582372009754181},{"id":"https://openalex.org/C83581934","wikidata":"https://www.wikidata.org/wiki/Q527381","display_name":"Arbitrary-precision arithmetic","level":2,"score":0.3137742877006531},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s00037-009-0260-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-009-0260-x","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.329.3054","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.329.3054","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uni-paderborn.de/agpb/work/6dich.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":26,"referenced_works":["https://openalex.org/W41330591","https://openalex.org/W412941528","https://openalex.org/W1487675067","https://openalex.org/W1542260560","https://openalex.org/W1550331971","https://openalex.org/W1553022663","https://openalex.org/W1602031045","https://openalex.org/W1784600267","https://openalex.org/W1968206655","https://openalex.org/W1973342538","https://openalex.org/W1981241857","https://openalex.org/W1989159237","https://openalex.org/W1991614107","https://openalex.org/W2003145641","https://openalex.org/W2003519998","https://openalex.org/W2006912660","https://openalex.org/W2024091095","https://openalex.org/W2033323875","https://openalex.org/W2034505758","https://openalex.org/W2044413922","https://openalex.org/W2071732851","https://openalex.org/W2082560626","https://openalex.org/W2082955605","https://openalex.org/W2126544654","https://openalex.org/W2170831059","https://openalex.org/W2396234570"],"related_works":["https://openalex.org/W1656092346","https://openalex.org/W2181927644","https://openalex.org/W2073476805","https://openalex.org/W1559551218","https://openalex.org/W2087454352","https://openalex.org/W2113155657","https://openalex.org/W1584254660","https://openalex.org/W2158464203","https://openalex.org/W2078971842","https://openalex.org/W1977231030"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":4}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}