{"id":"https://openalex.org/W2151306421","doi":"https://doi.org/10.1137/s0097539799360148","title":"Randomness is Hard","display_name":"Randomness is Hard","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2151306421","doi":"https://doi.org/10.1137/s0097539799360148","mag":"2151306421"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799360148","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799360148","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5083983355","display_name":"Harry Buhrman","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Harry Buhrman","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5004254084","display_name":"Leen Torenvliet","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Leen Torenvliet","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5083983355"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8782,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.86640765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"30","issue":"5","first_page":"1485","last_page":"1501"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9998999834060669,"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.9998999834060669,"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.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/T12072","display_name":"Machine Learning and Algorithms","score":0.9994000196456909,"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/combinatorics","display_name":"Combinatorics","score":0.7485014796257019},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.6148658990859985},{"id":"https://openalex.org/keywords/randomness","display_name":"Randomness","score":0.5541068911552429},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.542396068572998},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.5394045114517212},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5238663554191589},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4810769557952881},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42986661195755005},{"id":"https://openalex.org/keywords/exponent","display_name":"Exponent","score":0.41593965888023376}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7485014796257019},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.6148658990859985},{"id":"https://openalex.org/C125112378","wikidata":"https://www.wikidata.org/wiki/Q176640","display_name":"Randomness","level":2,"score":0.5541068911552429},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.542396068572998},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.5394045114517212},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5238663554191589},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4810769557952881},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42986661195755005},{"id":"https://openalex.org/C2780388253","wikidata":"https://www.wikidata.org/wiki/Q5421508","display_name":"Exponent","level":2,"score":0.41593965888023376},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539799360148","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799360148","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:dare.uva.nl:openaire_cris_publications/45e1b984-a1a1-4726-baed-7dcd13cb4da0","is_oa":false,"landing_page_url":"https://handle.uba.uva.nl/personal/pure/en/publications/randomness-is-hard(45e1b984-a1a1-4726-baed-7dcd13cb4da0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306400088","display_name":"UvA-DARE (University of Amsterdam)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I887064364","host_organization_name":"University of Amsterdam","host_organization_lineage":["https://openalex.org/I887064364"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Buhrman, H M & Torenvliet, L 2000, 'Randomness is Hard', SIAM Journal on Computing, vol. 30, no. 5, pp. 1485-1501. https://doi.org/10.1137/S0097539799360148","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:uvapub:oai:dare.uva.nl:publications/45e1b984-a1a1-4726-baed-7dcd13cb4da0","is_oa":false,"landing_page_url":"https://dare.uva.nl/personal/pure/en/publications/randomness-is-hard(45e1b984-a1a1-4726-baed-7dcd13cb4da0).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 30(5), 1485 - 1501. Society for Industrial and Applied Mathematics Publications","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1966098169","https://openalex.org/W1986602165","https://openalex.org/W1987331423","https://openalex.org/W2004471951","https://openalex.org/W2010997439","https://openalex.org/W2041317738","https://openalex.org/W2057512592","https://openalex.org/W2072242455","https://openalex.org/W2082647621","https://openalex.org/W2086059606","https://openalex.org/W2125495920","https://openalex.org/W2293988196","https://openalex.org/W4230960895","https://openalex.org/W4237363759"],"related_works":["https://openalex.org/W205898265","https://openalex.org/W2339463319","https://openalex.org/W1862457258","https://openalex.org/W2394774086","https://openalex.org/W2147424650","https://openalex.org/W2243799055","https://openalex.org/W2065950160","https://openalex.org/W2950473704","https://openalex.org/W4301296037","https://openalex.org/W2094688861"],"abstract_inverted_index":{"We":[0,95],"study":[1,23],"the":[2,32,42,59,69,86,97,105,119,128,133,151,171,187],"set":[3,60,70,134,152,188],"of":[4,12,19,54,61,71,88,107,121,135,153,174,189],"incompressible":[5],"strings":[6,63,72,155,194],"for":[7,90,156,162,182,198],"various":[8,157],"resource":[9,16,158],"bounded":[10,17,45],"versions":[11,18],"Kolmogorov":[13,20,46,192],"complexity.":[14],"The":[15],"complexity":[21,28,47,163],"we":[22,57],"are":[24],"polynomial":[25,43,183],"time":[26,184,191],"CD":[27],"defined":[29,110],"by":[30,50,111],"Sipser,":[31],"nondeterministic":[33,166],"variant":[34],"CND":[35],"due":[36],"to":[37,85],"Buhrman":[38,175],"and":[39,41,66,78,92,176],"Fortnow,":[40],"space":[44],"CS":[48],"introduced":[49],"Hartmanis.":[51],"For":[52],"all":[53],"these":[55],"measures":[56],"define":[58],"random":[62,144,154,193],"$\\mathrm{R}^{\\mathit{CD}}_t$,":[64],"$\\mathrm{R}^{\\mathit{CND}}_t$,":[65],"$\\mathrm{R}^{\\mathit{CS}}_t$":[67],"as":[68],"x":[73,89,142],"such":[74],"that":[75,141,150,181],"$\\mathit{CD}^t(x)$,":[76],"$\\mathit{CND}^t(x)$,":[77],"$\\mathit{CS}^s(x)$":[79],"is":[80,104,118,132,143,160,195],"greater":[81],"than":[82],"or":[83],"equal":[84],"length":[87],"s":[91],"t":[93],"polynomials.":[94],"show":[96,149,180],"following:":[98],"$\\mathrm{MA}":[99],"\\subseteq":[100,114,125],"\\mathrm{NP}^{\\mathrm{R}^{\\mathit{CD}}_t}$,":[101],"where":[102,116,178],"$\\mathrm{MA}$":[103],"class":[106,120],"Merlin--Arthur":[108],"games":[109],"Babai.":[112],"$\\mathrm{AM}":[113],"\\mathrm{NP}^{\\mathrm{R}^{\\mathit{CND}}_t}$,":[115],"$\\mathrm{AM}$":[117],"Arthur--Merlin":[122],"games.":[123],"$\\mathrm{PSPACE}":[124],"\\mathrm{NP}^{\\mathrm{cR}^{\\mathit{CS}}_s}$.":[126],"In":[127],"last":[129],"item":[130],"$\\mathrm{cR}^{\\mathit{CS}}_s$":[131],"pairs":[136],"$\\langle":[137],"x,y":[138],"\\rangle$":[139],"so":[140],"given":[145],"y.":[146],"These":[147],"results":[148],"bounds":[159],"hard":[161],"classes":[164],"under":[165],"reductions.":[167],"This":[168],"paper":[169],"contrasts":[170],"earlier":[172],"work":[173],"Mayordomo":[177],"they":[179],"deterministic":[185],"reductions":[186],"exponential":[190],"not":[196],"complete":[197],"EXP.":[199]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-17T09:09:15.849793","created_date":"2016-06-24T00:00:00"}