{"id":"https://openalex.org/W2042051386","doi":"https://doi.org/10.1137/0222012","title":"The Complexity of Malign Measures","display_name":"The Complexity of Malign Measures","publication_year":1993,"publication_date":"1993-02-01","ids":{"openalex":"https://openalex.org/W2042051386","doi":"https://doi.org/10.1137/0222012","mag":"2042051386"},"language":"en","primary_location":{"id":"doi:10.1137/0222012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222012","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/A5006968747","display_name":"Peter Bro Miltersen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Peter Bro Miltersen","raw_affiliation_strings":["Aarhus University, Aarhus , Denmark"],"affiliations":[{"raw_affiliation_string":"Aarhus University, Aarhus , Denmark","institution_ids":["https://openalex.org/I204337017"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5006968747"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":null,"apc_paid":null,"fwci":3.1383,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.91636446,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":null,"biblio":{"volume":"22","issue":"1","first_page":"147","last_page":"156"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9969000220298767,"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.9969000220298767,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9656000137329102,"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"}},{"id":"https://openalex.org/T13720","display_name":"Benford\u2019s Law and Fraud Detection","score":0.9430000185966492,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.8000751733779907},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.6828559041023254},{"id":"https://openalex.org/keywords/complexity-class","display_name":"Complexity class","score":0.606260359287262},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.5993506908416748},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5864978432655334},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5327081084251404},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4998819828033447},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4879416823387146},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4852457046508789},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.46461737155914307},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4356520175933838},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.42976635694503784},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3297426104545593},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2998737096786499},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1297692358493805}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.8000751733779907},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.6828559041023254},{"id":"https://openalex.org/C39637292","wikidata":"https://www.wikidata.org/wiki/Q908207","display_name":"Complexity class","level":3,"score":0.606260359287262},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.5993506908416748},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5864978432655334},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5327081084251404},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4998819828033447},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4879416823387146},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4852457046508789},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.46461737155914307},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4356520175933838},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.42976635694503784},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3297426104545593},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2998737096786499},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1297692358493805},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/0222012","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0222012","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:pure.atira.dk:publications/359d7630-b1d0-11df-8c1a-000ea68e967b","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/359d7630-b1d0-11df-8c1a-000ea68e967b","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Miltersen, P B 1993, 'The complexity of malign measures', S I A M Journal on Computing, vol. 22, no. 1, pp. 147-156. https://doi.org/10.1137/0222012","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":4,"referenced_works":["https://openalex.org/W2029308360","https://openalex.org/W2070695637","https://openalex.org/W2071747565","https://openalex.org/W2100008268"],"related_works":["https://openalex.org/W2161147766","https://openalex.org/W2173966285","https://openalex.org/W1759995226","https://openalex.org/W2990853482","https://openalex.org/W2327776271","https://openalex.org/W2374430960","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W1589381382","https://openalex.org/W2030312085"],"abstract_inverted_index":{"This":[0],"paper":[1],"analyzes":[2],"the":[3,9,15,22,40,64],"concept":[4],"of":[5,11,30,42,66,78],"malignness,":[6],"which":[7,45,53],"is":[8,72],"property":[10],"probability":[12],"ensembles":[13],"making":[14],"average":[16],"case":[17,24],"running":[18,25],"time":[19,26,50,58,68,83,97],"equal":[20],"to":[21],"worst":[23],"for":[27,48,63,75],"a":[28,81],"class":[29,65,77],"algorithms.":[31,69],"The":[32],"author":[33],"derives":[34],"lower":[35],"and":[36,52],"upper":[37],"bounds":[38],"on":[39],"complexity":[41],"malign":[43,60,85],"ensembles,":[44],"are":[46],"tight":[47],"exponential":[49],"algorithms,":[51],"show":[54],"that":[55,74],"no":[56,76],"polynomial":[57,67,82,96],"computable":[59],"ensemble":[61,86],"exists":[62],"Furthermore,":[70],"it":[71],"shown":[73],"superlinear":[79],"algorithms":[80],"samplable":[84],"exists,":[87],"unless":[88],"every":[89],"language":[90],"in":[91],"P":[92],"has":[93],"an":[94],"expected":[95],"constructor.":[98]},"counts_by_year":[],"updated_date":"2026-03-12T08:34:05.389933","created_date":"2025-10-10T00:00:00"}