{"id":"https://openalex.org/W1974865967","doi":"https://doi.org/10.1142/s0129054113500378","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":2013,"publication_date":"2013-12-01","ids":{"openalex":"https://openalex.org/W1974865967","doi":"https://doi.org/10.1142/s0129054113500378","mag":"1974865967"},"language":"en","primary_location":{"id":"doi:10.1142/s0129054113500378","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500378","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","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/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 Hakubi Center for Advanced Research, Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"The Hakubi Center for Advanced Research, Graduate School of Informatics, Kyoto University, Yoshida Honmachi, Sakyo-ku, Kyoto 606-8501, Japan","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":null,"apc_paid":null,"fwci":0.3645,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.61822041,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"24","issue":"08","first_page":"1339","last_page":"1354"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9994999766349792,"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.9983999729156494,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.8777952790260315},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.8471291065216064},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7530006170272827},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.680157482624054},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6294843554496765},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48509085178375244},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.42537885904312134},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3726828992366791},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.31620925664901733},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.17309114336967468},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.11045154929161072},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.10935917496681213},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10473978519439697}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.8777952790260315},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.8471291065216064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7530006170272827},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.680157482624054},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6294843554496765},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48509085178375244},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.42537885904312134},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3726828992366791},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.31620925664901733},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.17309114336967468},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.11045154929161072},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.10935917496681213},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10473978519439697},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129054113500378","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129054113500378","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2988164685","display_name":"Approximate Computing to Cope with Imperfect Information from Growing Data Size","funder_award_id":"25240002","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"},{"id":"https://openalex.org/G381231459","display_name":"New Development of Computation Theory by Exploring the Subadditive Structure","funder_award_id":"24700010","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1857141208","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/W2106264302","https://openalex.org/W2123056342","https://openalex.org/W2126323053","https://openalex.org/W2137608191","https://openalex.org/W2149120558"],"related_works":["https://openalex.org/W1532729668","https://openalex.org/W4386096164","https://openalex.org/W2055782437","https://openalex.org/W2107689258","https://openalex.org/W4205854323","https://openalex.org/W2115855742","https://openalex.org/W2059496069","https://openalex.org/W3149578574","https://openalex.org/W4387578030","https://openalex.org/W2378280103"],"abstract_inverted_index":{"Karchmer,":[0],"Kushilevitz":[1],"and":[2,18,65],"Nisan":[3],"formulated":[4],"the":[5,15,23,39,48,66,70,84,90,95,102,111],"formula":[6,29,57,113],"size":[7,30,58,114],"problem":[8,13,41],"as":[9],"an":[10],"integer":[11],"programming":[12],"called":[14,22],"rectangle":[16,85,96],"bound":[17,32,64,72,81,92,104],"introduced":[19],"a":[20,28,35,62,79],"technique":[21],"LP":[24,49],"bound,":[25,50,86],"which":[26],"gives":[27],"lower":[31,59,80,115],"by":[33],"showing":[34],"feasible":[36],"solution":[37],"of":[38,42,47],"dual":[40],"its":[43],"LP-relaxation.":[44],"As":[45],"extensions":[46],"we":[51,87],"introduce":[52],"novel":[53],"general":[54],"techniques":[55],"proving":[56],"bounds,":[60],"named":[61],"quasi-additive":[63,91,103],"Sherali-Adams":[67,71],"bound.":[68,97,116],"While":[69],"is":[73,105],"potentially":[74,106],"strong":[75,107],"enough":[76,108],"to":[77,83,109],"give":[78],"matching":[82,112],"prove":[88,110],"that":[89,101],"can":[93],"surpass":[94],"We":[98],"also":[99],"reveal":[100]},"counts_by_year":[{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-13T07:31:44.756512","created_date":"2025-10-10T00:00:00"}