{"id":"https://openalex.org/W1577549388","doi":"https://doi.org/10.1109/ccc.2004.1313842","title":"Partial Bi-immunity and NP-completeness","display_name":"Partial Bi-immunity and NP-completeness","publication_year":2004,"publication_date":"2004-11-13","ids":{"openalex":"https://openalex.org/W1577549388","doi":"https://doi.org/10.1109/ccc.2004.1313842","mag":"1577549388"},"language":"en","primary_location":{"id":"doi:10.1109/ccc.2004.1313842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-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/A5077270481","display_name":"John M. Hitchcock","orcid":"https://orcid.org/0000-0002-8614-7307"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"J.M. Hitchcock","raw_affiliation_strings":["Department of Computer Science, University of Wurzburg, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Wurzburg, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112023986","display_name":"A. Pavan","orcid":"https://orcid.org/0000-0003-1665-5266"},"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":"A. Pavan","raw_affiliation_strings":["Department of Computer Science, Iowa State University, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Iowa State University, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5031088478","display_name":"N. V. Vinodchandran","orcid":"https://orcid.org/0000-0001-7959-4662"},"institutions":[{"id":"https://openalex.org/I114395901","display_name":"University of Nebraska\u2013Lincoln","ror":"https://ror.org/043mer456","country_code":"US","type":"education","lineage":["https://openalex.org/I114395901"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"N.V. Vinodchandran","raw_affiliation_strings":["Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, University of Nebraska, Lincoln, USA","institution_ids":["https://openalex.org/I114395901"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5077270481"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07215032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"9","issue":null,"first_page":"198","last_page":"203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9965999722480774,"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.9965999722480774,"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.9876000285148621,"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.9804999828338623,"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/completeness","display_name":"Completeness (order theory)","score":0.7655154466629028},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6814976334571838},{"id":"https://openalex.org/keywords/turing","display_name":"Turing","score":0.6745922565460205},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.6032506823539734},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.502197265625},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.473683625459671},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4056057631969452},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.334381639957428},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.29508984088897705},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.13094449043273926}],"concepts":[{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.7655154466629028},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6814976334571838},{"id":"https://openalex.org/C9870796","wikidata":"https://www.wikidata.org/wiki/Q490481","display_name":"Turing","level":2,"score":0.6745922565460205},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.6032506823539734},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.502197265625},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.473683625459671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4056057631969452},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.334381639957428},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.29508984088897705},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.13094449043273926},{"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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccc.2004.1313842","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccc.2004.1313842","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 19th IEEE Annual Conference on Computational Complexity, 2004.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1510439348","https://openalex.org/W1736840982","https://openalex.org/W1966945335","https://openalex.org/W1972216634","https://openalex.org/W1981282181","https://openalex.org/W1985343313","https://openalex.org/W1986203294","https://openalex.org/W1995293773","https://openalex.org/W2036265926","https://openalex.org/W2039334189","https://openalex.org/W2068655609","https://openalex.org/W2080139332","https://openalex.org/W2085634981","https://openalex.org/W2087899564","https://openalex.org/W2106436148","https://openalex.org/W2132892595","https://openalex.org/W2180548934","https://openalex.org/W2401610261"],"related_works":["https://openalex.org/W2119244842","https://openalex.org/W3160192459","https://openalex.org/W4324016496","https://openalex.org/W2215138167","https://openalex.org/W4231495498","https://openalex.org/W4312201671","https://openalex.org/W4254404873","https://openalex.org/W2621831792","https://openalex.org/W2090113742","https://openalex.org/W2053429109"],"abstract_inverted_index":{"The":[0,20,89],"Turing":[1],"and":[2,15,56,77,81,84,86],"many-one":[3],"completeness":[4],"notions":[5,47],"for":[6],"NP":[7,34,62],"have":[8],"been":[9],"previously":[10],"separated":[11],"under":[12,48],"measure,":[13],"genericity,":[14],"bi-immunity":[16,51],"hypotheses":[17],"on":[18,27,68],"NP.":[19],"proofs":[21],"of":[22,30,75,91],"all":[23],"these":[24],"results":[25,74],"rely":[26],"the":[28,44,73],"existence":[29],"a":[31,49,59,95],"language":[32,60],"in":[33,61],"with":[35],"almost":[36],"everywhere":[37],"hardness.":[38],"In":[39],"this":[40,92],"paper":[41],"we":[42],"separate":[43],"same":[45],"NP-completeness":[46],"partial":[50],"hypothesis":[52],"that":[53,63],"is":[54,64,94],"weaker":[55],"only":[57],"yields":[58],"hard":[65],"to":[66],"solve":[67],"most":[69],"strings.":[70],"This":[71],"improves":[72],"Lutz":[76],"Mayordomo":[78],"(1996),":[79],"Ambos-Spies":[80],"Bentzien":[82],"(2000),":[83],"Pavan":[85],"Selman":[87],"(2002).":[88],"proof":[90],"result":[93],"significant":[96],"departure":[97],"from":[98],"previous":[99],"work.":[100]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}