{"id":"https://openalex.org/W1532729668","doi":"https://doi.org/10.1007/978-3-642-15155-2_58","title":"Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds","display_name":"Breaking the Rectangle Bound Barrier against Formula Size Lower Bounds","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1532729668","doi":"https://doi.org/10.1007/978-3-642-15155-2_58","mag":"1532729668"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-15155-2_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15155-2_58","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/A5044704304","display_name":"Kenya Ueno","orcid":"https://orcid.org/0000-0002-5623-6595"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Kenya Ueno","raw_affiliation_strings":["The Young Researcher Development Center and Graduate School of Informatics, Kyoto University,"],"affiliations":[{"raw_affiliation_string":"The Young Researcher Development Center and Graduate School of Informatics, Kyoto University,","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044704304"],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.7271,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.6951486,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"109","issue":"235","first_page":"665","last_page":"676"},"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.9987999796867371,"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.9987999796867371,"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/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.9092464447021484},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8773455023765564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7256850600242615},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5669270157814026},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.5654967427253723},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5180092453956604},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.46940886974334717},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3793608844280243},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.3527274429798126},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.19134613871574402},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17309385538101196},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10945349931716919},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10508847236633301}],"concepts":[{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.9092464447021484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8773455023765564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7256850600242615},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5669270157814026},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.5654967427253723},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5180092453956604},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.46940886974334717},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3793608844280243},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3527274429798126},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.19134613871574402},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17309385538101196},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10945349931716919},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10508847236633301},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-15155-2_58","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-15155-2_58","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.401.1947","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.401.1947","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.lab2.kuis.kyoto-u.ac.jp/~kenya/MFCS2010.pdf","raw_type":"text"},{"id":"mag:2948963387","is_oa":false,"landing_page_url":"https://www.ieice.org/ken/paper/20091016XaQN/eng/","pdf_url":null,"source":{"id":"https://openalex.org/S4306512848","display_name":"IEICE Technical Report; IEICE Tech. Rep.","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"IEICE Technical Report; IEICE Tech. Rep.","raw_type":null}],"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/W1517585663","https://openalex.org/W1857141208","https://openalex.org/W1898387096","https://openalex.org/W1967344706","https://openalex.org/W1970193303","https://openalex.org/W1971022885","https://openalex.org/W2005223599","https://openalex.org/W2010730726","https://openalex.org/W2025605614","https://openalex.org/W2044982302","https://openalex.org/W2049016755","https://openalex.org/W2049143039","https://openalex.org/W2076535438","https://openalex.org/W2077397558","https://openalex.org/W2102687371","https://openalex.org/W2106264302","https://openalex.org/W2123056342","https://openalex.org/W2126323053","https://openalex.org/W2137608191","https://openalex.org/W2149120558","https://openalex.org/W2913728609","https://openalex.org/W4206794571"],"related_works":["https://openalex.org/W4386096164","https://openalex.org/W2055782437","https://openalex.org/W2107689258","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W3149578574","https://openalex.org/W2059496069","https://openalex.org/W4387578030","https://openalex.org/W2378280103","https://openalex.org/W4206993075"],"abstract_inverted_index":null,"counts_by_year":[{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}