{"id":"https://openalex.org/W4415979400","doi":"https://doi.org/10.46298/lmcs-21(4:23)2025","title":"On the consistency of stronger lower bounds for NEXP","display_name":"On the consistency of stronger lower bounds for NEXP","publication_year":2025,"publication_date":"2025-11-21","ids":{"openalex":"https://openalex.org/W4415979400","doi":"https://doi.org/10.46298/lmcs-21(4:23)2025"},"language":"en","primary_location":{"id":"doi:10.46298/lmcs-21(4:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:23)2025","pdf_url":"https://lmcs.episciences.org/16972/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://lmcs.episciences.org/16972/pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120288052","display_name":"Neil Thapen","orcid":null},"institutions":[{"id":"https://openalex.org/I4210100529","display_name":"Czech Academy of Sciences, Institute of Sociology","ror":"https://ror.org/018hy5194","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210100529"]},{"id":"https://openalex.org/I4210120266","display_name":"Czech Academy of Sciences, Institute of Mathematics","ror":"https://ror.org/02tv1yf50","country_code":"CZ","type":"facility","lineage":["https://openalex.org/I202391551","https://openalex.org/I4210120266"]}],"countries":["CZ"],"is_corresponding":true,"raw_author_name":"Neil Thapen","raw_affiliation_strings":["Institute of Mathematics , Czech Academy of Sciences"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematics , Czech Academy of Sciences","institution_ids":["https://openalex.org/I4210120266","https://openalex.org/I4210100529"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5120288052"],"corresponding_institution_ids":["https://openalex.org/I4210100529","https://openalex.org/I4210120266"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33010796,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"Volume 21, Issue 4","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.8601999878883362,"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.8601999878883362,"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.08030000329017639,"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/T10237","display_name":"Cryptography and Data Security","score":0.00839999970048666,"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/conjecture","display_name":"Conjecture","score":0.7379000186920166},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6154999732971191},{"id":"https://openalex.org/keywords/consistency","display_name":"Consistency (knowledge bases)","score":0.6039999723434448},{"id":"https://openalex.org/keywords/existential-quantification","display_name":"Existential quantification","score":0.3010999858379364},{"id":"https://openalex.org/keywords/degree","display_name":"Degree (music)","score":0.24950000643730164}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.803600013256073},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.7379000186920166},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6154999732971191},{"id":"https://openalex.org/C2776436953","wikidata":"https://www.wikidata.org/wiki/Q5163215","display_name":"Consistency (knowledge bases)","level":2,"score":0.6039999723434448},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4620000123977661},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43799999356269836},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3010999858379364},{"id":"https://openalex.org/C2775997480","wikidata":"https://www.wikidata.org/wiki/Q586277","display_name":"Degree (music)","level":2,"score":0.24950000643730164},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.23919999599456787},{"id":"https://openalex.org/C161505775","wikidata":"https://www.wikidata.org/wiki/Q3240280","display_name":"Direct proof","level":2,"score":0.23899999260902405}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.46298/lmcs-21(4:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:23)2025","pdf_url":"https://lmcs.episciences.org/16972/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2504.03320","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2504.03320","pdf_url":"https://arxiv.org/pdf/2504.03320","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2504.03320","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2504.03320","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"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":"article"}],"best_oa_location":{"id":"doi:10.46298/lmcs-21(4:23)2025","is_oa":true,"landing_page_url":"https://doi.org/10.46298/lmcs-21(4:23)2025","pdf_url":"https://lmcs.episciences.org/16972/pdf","source":{"id":"https://openalex.org/S114379355","display_name":"Logical Methods in Computer Science","issn_l":"1860-5974","issn":["1860-5974"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310313916","host_organization_name":"Logical Methods in Computer Science e.V.","host_organization_lineage":["https://openalex.org/P4310313916"],"host_organization_lineage_names":["Logical Methods in Computer Science e.V."],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Logical Methods in Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1741043573","display_name":null,"funder_award_id":"67985840","funder_id":"https://openalex.org/F4320322482","funder_display_name":"Akademie V\u011bd \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G8746491555","display_name":null,"funder_award_id":"RVO 67985840","funder_id":"https://openalex.org/F4320322482","funder_display_name":"Akademie V\u011bd \u010cesk\u00e9 Republiky"},{"id":"https://openalex.org/G8847727193","display_name":null,"funder_award_id":"RVO 6798584","funder_id":"https://openalex.org/F4320322482","funder_display_name":"Akademie V\u011bd \u010cesk\u00e9 Republiky"}],"funders":[{"id":"https://openalex.org/F4320322482","display_name":"Akademie V\u011bd \u010cesk\u00e9 Republiky","ror":"https://ror.org/053avzc18"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4415979400.pdf","grobid_xml":"https://content.openalex.org/works/W4415979400.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"It":[0],"was":[1],"recently":[2],"shown":[3],"by":[4],"Atserias,":[5],"Buss":[6],"and":[7,59],"Mueller":[8],"that":[9,41,49],"the":[10,23,50],"standard":[11],"complexity-theoretic":[12],"conjecture":[13],"NEXP":[14,53,60],"not":[15,54,61],"in":[16,55,62],"P":[17],"/":[18,57],"poly":[19,58],"is":[20],"consistent":[21,65],"with":[22,66],"relatively":[24],"strong":[25],"bounded":[26],"arithmetic":[27],"theory":[28],"V^0_2,":[29],"which":[30,70],"can":[31,44],"prove":[32],"a":[33,67],"substantial":[34],"part":[35],"of":[36],"complexity":[37],"theory.":[38],"We":[39],"observe":[40],"their":[42],"approach":[43],"be":[45],"extended":[46],"to":[47],"show":[48],"stronger":[51,68],"conjectures":[52],"EXP":[56],"coNEXP":[63],"are":[64],"theory,":[69],"includes":[71],"every":[72],"true":[73],"universal":[74],"number-sort":[75],"sentence.":[76]},"counts_by_year":[],"updated_date":"2026-04-22T08:38:42.863108","created_date":"2025-10-10T00:00:00"}