{"id":"https://openalex.org/W2024435371","doi":"https://doi.org/10.1137/s0097539701396959","title":"A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates","display_name":"A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log <i>n</i> Negation Gates","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2024435371","doi":"https://doi.org/10.1137/s0097539701396959","mag":"2024435371"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539701396959","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701396959","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5050504059","display_name":"Kazuyuki Amano","orcid":"https://orcid.org/0000-0003-2322-6072"},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Kazuyuki Amano","raw_affiliation_strings":["Graduate School of Information Sciences , Tohoku University , Sendai , Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Sciences , Tohoku University , Sendai , Japan","institution_ids":["https://openalex.org/I201537933"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088040293","display_name":"Akira Maruoka","orcid":null},"institutions":[{"id":"https://openalex.org/I201537933","display_name":"Tohoku University","ror":"https://ror.org/01dq60k83","country_code":"JP","type":"education","lineage":["https://openalex.org/I201537933"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Akira Maruoka","raw_affiliation_strings":["Graduate School of Information Sciences , Tohoku University , Sendai , Japan"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Information Sciences , Tohoku University , Sendai , Japan","institution_ids":["https://openalex.org/I201537933"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.036,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.91484045,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"35","issue":"1","first_page":"201","last_page":"216"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9980999827384949,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9976999759674072,"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/clique","display_name":"Clique","score":0.7468242645263672},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6228859424591064},{"id":"https://openalex.org/keywords/negation","display_name":"Negation","score":0.5932838916778564},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5674132704734802},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5500152111053467},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.5025932788848877},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4988579750061035},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4867251217365265},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4663158357143402},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.25925934314727783}],"concepts":[{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.7468242645263672},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6228859424591064},{"id":"https://openalex.org/C2185349","wikidata":"https://www.wikidata.org/wiki/Q190558","display_name":"Negation","level":2,"score":0.5932838916778564},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5674132704734802},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5500152111053467},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.5025932788848877},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4988579750061035},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4867251217365265},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4663158357143402},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.25925934314727783},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539701396959","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539701396959","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W205871068","https://openalex.org/W2005938320","https://openalex.org/W2012476164","https://openalex.org/W2022093588","https://openalex.org/W2027898675","https://openalex.org/W2030387300","https://openalex.org/W2038272454","https://openalex.org/W2054271696","https://openalex.org/W2099594773","https://openalex.org/W2160337591","https://openalex.org/W2165293955","https://openalex.org/W2912080987"],"related_works":["https://openalex.org/W2040339278","https://openalex.org/W217353991","https://openalex.org/W2021728158","https://openalex.org/W2950704194","https://openalex.org/W2788853667","https://openalex.org/W4297727143","https://openalex.org/W3157898686","https://openalex.org/W3087231590","https://openalex.org/W2127581878","https://openalex.org/W4296603869"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,41,132,179],"investigate":[4],"the":[5,9,19,35,50,60,71,76,122,134,164,176,188,193,201,206,209,214],"lower":[6,32,119,191,204],"bound":[7],"on":[8,34,121],"number":[10,25,135,165],"of":[11,26,37,97,124,136,149,166,190,203,208,213,220],"gates":[12,94,138,168],"in":[13,75,102,175,216],"a":[14,23,39,43,83,103,141,147,217],"Boolean":[15],"circuit":[16,40,84,195,211],"that":[17,81,160,187],"computes":[18],"clique":[20],"function":[21],"with":[22,86,105],"limited":[24],"negation":[27,93,137,167],"gates.":[28,116],"To":[29],"derive":[30],"strong":[31],"bounds":[33,120],"size":[36,98,123],"such":[38,125],"develop":[42],"new":[44],"approach":[45],"by":[46],"combining":[47],"three":[48],"approaches:":[49],"restriction":[51],"applied":[52,63],"to":[53,58,64,68,139,172,200],"constant":[54],"depth":[55],"circuits":[56,66,126],"due":[57,67],"H\u00e5stad,":[59],"approximation":[61],"method":[62],"monotone":[65,210,221],"Razborov,":[69],"and":[70],"boundary":[72],"covering":[73],"developed":[74],"present":[77],"paper.":[78],"We":[79,184],"prove":[80],"if":[82,131],"C":[85,109],"at":[87,111],"most":[88],"$\\floor{(1/6)":[89],"\\log":[90,91],"m}$":[92,171,174],"detects":[95],"cliques":[96],"$(\\log":[99],"m)^{3(\\log":[100],"m)^{1/2}}$":[101],"graph":[104],"m":[106],"vertices,":[107],"then":[108,178],"contains":[110],"least":[112],"$2^{(1/5)(\\log":[113],"m)^{(\\log":[114],"m)^{1/2}}}$":[115],"No":[117],"nontrivial":[118],"were":[127],"previously":[128],"known,":[129],"even":[130],"restrict":[133],"be":[140,198],"constant.":[142],"Moreover,":[143],"it":[144],"follows":[145],"from":[146,169],"result":[148],"Fischer":[150],"[{\\it":[151],"Lect.":[152],"Notes":[153],"Comput.":[154],"Sci.,}":[155],"33":[156],"(1974),":[157],"pp.":[158],"71--82]":[159],"ifone":[161],"can":[162,197],"improve":[163],"$\\floor{(1/6)\\log\\log":[170],"$\\floor{2\\log":[173],"statement,":[177],"have":[180],"P":[181],"$\\neq$":[182],"NP.":[183],"also":[185],"show":[186],"problem":[189],"bounding":[192,205],"negation-limited":[194],"complexity":[196,212],"reduced":[199],"one":[202],"maximum":[207],"functions":[215],"certain":[218],"class":[219],"functions.":[222]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}