{"id":"https://openalex.org/W2465024128","doi":"https://doi.org/10.4230/lipics.ccc.2016.19","title":"New Non-Uniform Lower Bounds for Uniform Classes","display_name":"New Non-Uniform Lower Bounds for Uniform Classes","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2465024128","doi":"https://doi.org/10.4230/lipics.ccc.2016.19","mag":"2465024128"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5850","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol050-ccc2016/LIPIcs.CCC.2016.19/LIPIcs.CCC.2016.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"type":"article","indexed_in":["datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol050-ccc2016/LIPIcs.CCC.2016.19/LIPIcs.CCC.2016.19.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075191567","display_name":"Lance Fortnow","orcid":"https://orcid.org/0000-0002-2020-1358"},"institutions":[{"id":"https://openalex.org/I130701444","display_name":"Georgia Institute of Technology","ror":"https://ror.org/01zkghx44","country_code":"US","type":"education","lineage":["https://openalex.org/I130701444"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Fortnow, Lance","raw_affiliation_strings":["Georgia Inst. of Technol, Atlanta"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Georgia Inst. of Technol, Atlanta","institution_ids":["https://openalex.org/I130701444"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I40120149","display_name":"University of Oxford","ror":"https://ror.org/052gg0110","country_code":"GB","type":"education","lineage":["https://openalex.org/I40120149"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Santhanam, Rahul","raw_affiliation_strings":["University of Oxford, Oxford , United Kingdom#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Oxford, Oxford , United Kingdom#TAB#","institution_ids":["https://openalex.org/I40120149"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9865,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.7915193,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9998000264167786,"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.9998000264167786,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9976000189781189,"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8252032399177551},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7339441180229187},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6911919116973877},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6330523490905762},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.6045222878456116},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5807461142539978},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.5604166388511658},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.526443362236023},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.47147679328918457},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.47014978528022766},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.46635735034942627},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.41823485493659973},{"id":"https://openalex.org/keywords/structural-complexity-theory","display_name":"Structural complexity theory","score":0.4165509343147278},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.28693878650665283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.1183575987815857},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.11809495091438293}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8252032399177551},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7339441180229187},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6911919116973877},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6330523490905762},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.6045222878456116},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5807461142539978},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.5604166388511658},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.526443362236023},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.47147679328918457},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.47014978528022766},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.46635735034942627},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.41823485493659973},{"id":"https://openalex.org/C131583701","wikidata":"https://www.wikidata.org/wiki/Q7625020","display_name":"Structural complexity theory","level":4,"score":0.4165509343147278},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.28693878650665283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.1183575987815857},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.11809495091438293},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5850","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol050-ccc2016/LIPIcs.CCC.2016.19/LIPIcs.CCC.2016.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.ccc.2016.19","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2016.19","pdf_url":null,"source":{"id":"https://openalex.org/S4393917817","display_name":"Leibniz international proceedings in informatics","issn_l":"1868-8969","issn":["1868-8969"],"is_oa":true,"is_in_doaj":true,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5850","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.CCC.2016.19","pdf_url":"https://drops.dagstuhl.de/storage/00lipics/lipics-vol050-ccc2016/LIPIcs.CCC.2016.19/LIPIcs.CCC.2016.19.pdf","source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G267624678","display_name":null,"funder_award_id":"615075","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G3207356259","display_name":null,"funder_award_id":"2007\u20132013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G393177772","display_name":null,"funder_award_id":"FP7 2007-2013","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5702163051","display_name":null,"funder_award_id":"FP7/2007","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2465024128.pdf","grobid_xml":"https://content.openalex.org/works/W2465024128.grobid-xml"},"referenced_works_count":20,"referenced_works":["https://openalex.org/W27953970","https://openalex.org/W1996834809","https://openalex.org/W1998918799","https://openalex.org/W2002089154","https://openalex.org/W2004471951","https://openalex.org/W2014343882","https://openalex.org/W2061489447","https://openalex.org/W2069864904","https://openalex.org/W2075449032","https://openalex.org/W2078924305","https://openalex.org/W2079357831","https://openalex.org/W2083039580","https://openalex.org/W2091641588","https://openalex.org/W2092429268","https://openalex.org/W2106793914","https://openalex.org/W2125495920","https://openalex.org/W2144345645","https://openalex.org/W2170007444","https://openalex.org/W2533977282","https://openalex.org/W2998808137"],"related_works":["https://openalex.org/W1531835879","https://openalex.org/W2091641588","https://openalex.org/W2950999115","https://openalex.org/W2119964139","https://openalex.org/W2751668514","https://openalex.org/W3127217102","https://openalex.org/W275231650","https://openalex.org/W2031137635","https://openalex.org/W1615793053","https://openalex.org/W1995725694","https://openalex.org/W1987681136","https://openalex.org/W1500625764","https://openalex.org/W2120210041","https://openalex.org/W147059047","https://openalex.org/W2157709541","https://openalex.org/W1542401186","https://openalex.org/W2006787007","https://openalex.org/W3023658018","https://openalex.org/W2169644995","https://openalex.org/W2037563943"],"abstract_inverted_index":{"We":[0,86,114],"strengthen":[1],"the":[2,13,73,83,136,220],"nondeterministic":[3],"hierarchy":[4,89,123],"theorem":[5,90,124],"for":[6,25,39,93,125,166,175,206,219],"non-deterministic":[7,126,170],"polynomial":[8,99,102,106],"time":[9,84,100,107,231],"to":[10,82,91,119],"show":[11,23,214],"that":[12,24,32,192],"lower":[14,74,137,164,217],"bound":[15,42,138,165],"holds":[16,139],"against":[17,168],"sub-linear":[18,131],"advice.":[19],"More":[20],"formally,":[21],"we":[22,160,213],"any":[26,40,109,176,207],"constants":[27],"d":[28,35],"and":[29,38,63,76,101],"d'":[30],"such":[31],"1":[33],"<=":[34],"<":[36],"d',":[37],"time-constructible":[41],"t=o(n^d),":[43],"there":[44],"is":[45,51,181],"a":[46,130,162,182,186],"language":[47],"in":[48,53,72,227],"NTIME(n^d)":[49],"which":[50,128,190],"not":[52,78,193],"NTIME(t)/n^{1/d'}.":[54],"The":[55],"best":[56],"known":[57],"earlier":[58],"separation":[59],"of":[60,70,112,133,156,172,185,188,195,203,224],"Fortnow,":[61],"Santhanam":[62],"Trevisan":[64],"could":[65],"only":[66],"handle":[67],"o(log(n))":[68],"bits":[69],"advice":[71],"bound,":[75],"was":[77],"tight":[79],"with":[80,108,200,232],"respect":[81],"bounds.":[85],"generalize":[87],"our":[88,117,157],"work":[92],"other":[94],"syntactic":[95],"complexity":[96,221],"measures":[97],"between":[98],"space,":[103],"including":[104],"alternating":[105],"fixed":[110,177,208],"number":[111],"alternations.":[113],"also":[115],"use":[116,129],"technique":[118],"derive":[120,161],"an":[121],"almost-everywhere":[122],"classes":[127],"amount":[132],"non-determinism,":[134],"i.e.,":[135],"on":[140,150],"all":[141,194],"but":[142],"finitely":[143],"many":[144],"input":[145],"lengths":[146],"rather":[147],"than":[148],"just":[149],"infinitely":[151],"many.":[152],"As":[153,210],"one":[154,233],"application":[155],"main":[158],"result,":[159],"new":[163],"NP":[167,196],"NP-uniform":[169],"circuits":[171,202],"size":[173,204],"O(n^k)":[174,205],"k.":[178,209],"This":[179],"result":[180,187],"significant":[183],"strengthening":[184],"Kannan,":[189],"states":[191],"can":[197],"be":[198],"solved":[199],"P-uniform":[201],"another":[211],"application,":[212],"strong":[215],"non-uniform":[216],"bounds":[218],"class":[222],"RE":[223],"languages":[225],"decidable":[226],"randomized":[228],"linear":[229],"exponential":[230],"sided":[234],"error.":[235]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2026-09-13T09:14:26.050021","created_date":"2025-10-10T00:00:00"}