{"id":"https://openalex.org/W2244043162","doi":"https://doi.org/10.4230/lipics.stacs.2010.2471","title":"Inseparability and Strong Hypotheses for Disjoint NP Pairs","display_name":"Inseparability and Strong Hypotheses for Disjoint NP Pairs","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2244043162","doi":"https://doi.org/10.4230/lipics.stacs.2010.2471","mag":"2244043162"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:2471","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2471","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.stacs.2010.2471","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/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Fortnow, Lance","raw_affiliation_strings":["University of Chicago, Chicago, United States"],"affiliations":[{"raw_affiliation_string":"University of Chicago, Chicago, United States","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064796448","display_name":"Jack H. Lutz","orcid":"https://orcid.org/0000-0003-1004-3891"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lutz, Jack H.","raw_affiliation_strings":["Iowa State University, Ames, United States"],"affiliations":[{"raw_affiliation_string":"Iowa State University, Ames, United States","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075374500","display_name":"Elvira Mayordomo","orcid":"https://orcid.org/0000-0002-9109-5337"},"institutions":[{"id":"https://openalex.org/I255234318","display_name":"Universidad de Zaragoza","ror":"https://ror.org/012a91z28","country_code":"ES","type":"education","lineage":["https://openalex.org/I255234318"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Mayordomo, Elvira","raw_affiliation_strings":["Universidad de Zaragoza, Zaragoza, Spain"],"affiliations":[{"raw_affiliation_string":"Universidad de Zaragoza, Zaragoza, Spain","institution_ids":["https://openalex.org/I255234318"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075191567"],"corresponding_institution_ids":["https://openalex.org/I40347166"],"apc_list":null,"apc_paid":null,"fwci":0.3345,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.64778973,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"5","issue":null,"first_page":"395","last_page":"404"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.996999979019165,"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/T11567","display_name":"semigroups and automata theory","score":0.996999979019165,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9937000274658203,"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.9883000254631042,"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/disjoint-sets","display_name":"Disjoint sets","score":0.9332461357116699},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.8140239715576172},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5116879940032959},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.4890476167201996},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4537014663219452},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.42917773127555847},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.42176324129104614},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3555196523666382},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.19790533185005188},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.07575899362564087},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.066804438829422}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.9332461357116699},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.8140239715576172},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5116879940032959},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.4890476167201996},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4537014663219452},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.42917773127555847},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.42176324129104614},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3555196523666382},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.19790533185005188},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.07575899362564087},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.066804438829422}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:2471","is_oa":false,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.STACS.2010.2471","pdf_url":null,"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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"doi:10.4230/lipics.stacs.2010.2471","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2010.2471","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""},{"id":"mag:2244043162","is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/stacs/stacs2010.html#FortnowLM10","pdf_url":null,"source":{"id":"https://openalex.org/S4306421002","display_name":"Symposium on Theoretical Aspects of Computer Science","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":"Symposium on Theoretical Aspects of Computer Science","raw_type":null}],"best_oa_location":{"id":"doi:10.4230/lipics.stacs.2010.2471","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.stacs.2010.2471","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":""},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322930","display_name":"Ministerio de Ciencia e Innovaci\u00f3n","ror":"https://ror.org/034900433"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2119677808","https://openalex.org/W1588493806","https://openalex.org/W2626569379","https://openalex.org/W2104082376","https://openalex.org/W1967048340","https://openalex.org/W1484374795","https://openalex.org/W1624183486","https://openalex.org/W2565305995","https://openalex.org/W2516432634","https://openalex.org/W1981741030","https://openalex.org/W42931805","https://openalex.org/W3167488367","https://openalex.org/W2739273244","https://openalex.org/W3000303691","https://openalex.org/W2059997023","https://openalex.org/W2032941175","https://openalex.org/W2008585307","https://openalex.org/W2254028205","https://openalex.org/W2059025729","https://openalex.org/W2584230962"],"abstract_inverted_index":{"This":[0],"paper":[1],"investigates":[2],"the":[3],"existence":[4],"of":[5,9,38,60],"inseparable":[6],"disjoint":[7,36,61],"pairs":[8,37],"NP":[10,25,39],"languages":[11,40],"and":[12,58],"related":[13],"strong":[14,54],"hypotheses":[15,55],"in":[16,31,44],"computational":[17],"complexity.":[18],"Our":[19],"main":[20],"theorem":[21],"says":[22],"that,":[23],"if":[24],"does":[26],"not":[27],"have":[28],"measure":[29],"0":[30],"EXP,":[32],"then":[33],"there":[34],"exist":[35],"that":[41],"are":[42],"P-inseparable,":[43],"fact":[45],"TIME(2(n":[46],"k))-inseparable.":[47],"We":[48],"also":[49],"relate":[50],"these":[51],"conditions":[52],"to":[53],"concerning":[56],"randomness":[57],"genericity":[59],"pairs.":[62]},"counts_by_year":[],"updated_date":"2025-11-06T06:51:31.235846","created_date":"2025-10-10T00:00:00"}