{"id":"https://openalex.org/W2154098083","doi":"https://doi.org/10.1142/s0129626413500072","title":"INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM","display_name":"INDUCTIVE COMPLEXITY OF THE P VERSUS NP PROBLEM","publication_year":2013,"publication_date":"2013-03-01","ids":{"openalex":"https://openalex.org/W2154098083","doi":"https://doi.org/10.1142/s0129626413500072","mag":"2154098083"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626413500072","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626413500072","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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/A5079186295","display_name":"Cristian S. Calude","orcid":"https://orcid.org/0000-0002-8711-6799"},"institutions":[{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]},{"id":"https://openalex.org/I182145113","display_name":"Isaac Newton Institute for Mathematical Sciences","ror":"https://ror.org/007vkej58","country_code":"GB","type":"facility","lineage":["https://openalex.org/I182145113"]}],"countries":["GB","NZ"],"is_corresponding":true,"raw_author_name":"CRISTIAN S. CALUDE","raw_affiliation_strings":["Department of Computer Science, University of Auckland, Auckland, New Zealand","Isaac Newton Institute for Mathematical Sciences, Cambridge, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]},{"raw_affiliation_string":"Isaac Newton Institute for Mathematical Sciences, Cambridge, United Kingdom","institution_ids":["https://openalex.org/I182145113"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5052530286","display_name":"Elena Calude","orcid":"https://orcid.org/0000-0002-5962-0867"},"institutions":[{"id":"https://openalex.org/I51158804","display_name":"Massey University","ror":"https://ror.org/052czxv31","country_code":"NZ","type":"education","lineage":["https://openalex.org/I51158804"]}],"countries":["NZ"],"is_corresponding":false,"raw_author_name":"ELENA CALUDE","raw_affiliation_strings":["Institute of Natural and Mathematical Sciences, Massey University at Auckland, New Zealand"],"affiliations":[{"raw_affiliation_string":"Institute of Natural and Mathematical Sciences, Massey University at Auckland, New Zealand","institution_ids":["https://openalex.org/I51158804"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024379538","display_name":"Melissa S. Queen","orcid":null},"institutions":[{"id":"https://openalex.org/I107672454","display_name":"Dartmouth College","ror":"https://ror.org/049s0rh22","country_code":"US","type":"education","lineage":["https://openalex.org/I107672454"]},{"id":"https://openalex.org/I154130895","display_name":"University of Auckland","ror":"https://ror.org/03b94tp07","country_code":"NZ","type":"education","lineage":["https://openalex.org/I154130895"]}],"countries":["NZ","US"],"is_corresponding":false,"raw_author_name":"MELISSA S. QUEEN","raw_affiliation_strings":["Dartmouth College, New Hampshire, USA","Department of Computer Science, University of Auckland, Auckland, New Zealand"],"affiliations":[{"raw_affiliation_string":"Dartmouth College, New Hampshire, USA","institution_ids":["https://openalex.org/I107672454"]},{"raw_affiliation_string":"Department of Computer Science, University of Auckland, Auckland, New Zealand","institution_ids":["https://openalex.org/I154130895"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5079186295"],"corresponding_institution_ids":["https://openalex.org/I154130895","https://openalex.org/I182145113"],"apc_list":null,"apc_paid":null,"fwci":0.7251,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74833146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"01","first_page":"1350007","last_page":"1350007"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","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/T12002","display_name":"Computability, Logic, AI Algorithms","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/T11567","display_name":"semigroups and automata theory","score":0.9994000196456909,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9944000244140625,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/peano-axioms","display_name":"Peano axioms","score":0.7239725589752197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6332231163978577},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.5405681133270264},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5376461744308472},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4808564782142639},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.47528234124183655},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.46498414874076843},{"id":"https://openalex.org/keywords/inductive-reasoning","display_name":"Inductive reasoning","score":0.41346630454063416},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.41023704409599304},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.39488279819488525},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3913857340812683},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3376828730106354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32120731472969055},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2745071053504944}],"concepts":[{"id":"https://openalex.org/C97489613","wikidata":"https://www.wikidata.org/wiki/Q842755","display_name":"Peano axioms","level":2,"score":0.7239725589752197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6332231163978577},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.5405681133270264},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5376461744308472},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4808564782142639},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.47528234124183655},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.46498414874076843},{"id":"https://openalex.org/C21563000","wikidata":"https://www.wikidata.org/wiki/Q484511","display_name":"Inductive reasoning","level":2,"score":0.41346630454063416},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.41023704409599304},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.39488279819488525},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3913857340812683},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3376828730106354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32120731472969055},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2745071053504944},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626413500072","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626413500072","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","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":14,"referenced_works":["https://openalex.org/W2851918","https://openalex.org/W117996040","https://openalex.org/W563490355","https://openalex.org/W2035539034","https://openalex.org/W2036265926","https://openalex.org/W2043185883","https://openalex.org/W2045492613","https://openalex.org/W2077797656","https://openalex.org/W2093392279","https://openalex.org/W2137852471","https://openalex.org/W2155662766","https://openalex.org/W2165813048","https://openalex.org/W2404351250","https://openalex.org/W2745281314"],"related_works":["https://openalex.org/W2173966285","https://openalex.org/W2990853482","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2041069649","https://openalex.org/W2047754121","https://openalex.org/W2461808546","https://openalex.org/W2045590835","https://openalex.org/W2953001340","https://openalex.org/W1589381382"],"abstract_inverted_index":{"This":[0],"paper":[1],"does":[2],"not":[3,7],"propose":[4],"a":[5,9],"solution,":[6],"even":[8],"new":[10],"possible":[11],"attack,":[12],"to":[13],"the":[14,22,28,34,58,65,75,85,90,96,106],"P":[15,29,66,76,91],"versus":[16,30,67,77,92],"NP":[17,31,68,78,93],"problem.":[18,69],"We":[19],"are":[20,105],"asking":[21],"simpler":[23],"question:":[24],"How":[25],"\u201ccomplex\u201d":[26],"is":[27,80,100],"problem?":[32],"Using":[33],"inductive":[35,44,59],"complexity":[36,60],"measure\u2014a":[37],"measure":[38],"based":[39],"on":[40,57],"computations":[41],"run":[42],"by":[43],"register":[45],"machines":[46],"of":[47,61,64,73],"various":[48],"orders\u2014developed":[49],"in":[50,102,116],"[2],":[51],"we":[52],"determine":[53],"an":[54],"upper":[55],"bound":[56],"second":[62],"order":[63],"From":[70],"this":[71,117],"point":[72],"view,":[74],"problem":[79,94],"significantly":[81],"more":[82],"complex":[83,108],"than":[84],"Riemann":[86],"hypothesis.":[87],"To":[88],"date,":[89],"and":[95,113],"Goostein":[97],"theorem":[98],"(which":[99],"unprovable":[101],"Peano":[103],"Arithmetic)":[104],"most":[107],"mathematical":[109],"statements":[110],"(theorems,":[111],"conjectures":[112],"problems)":[114],"studied":[115],"framework":[118],"[9,":[119],"5,":[120],"6,":[121],"2,":[122],"20].":[123]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}