{"id":"https://openalex.org/W2171116055","doi":"https://doi.org/10.1145/2656210","title":"Smoothed Complexity Theory","display_name":"Smoothed Complexity Theory","publication_year":2015,"publication_date":"2015-05-11","ids":{"openalex":"https://openalex.org/W2171116055","doi":"https://doi.org/10.1145/2656210","mag":"2171116055"},"language":"en","primary_location":{"id":"doi:10.1145/2656210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656210","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://ris.utwente.nl/ws/files/6722279/SmoothedComp_Journal.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035530886","display_name":"Markus Bl\u00e4ser","orcid":"https://orcid.org/0000-0002-1750-9036"},"institutions":[{"id":"https://openalex.org/I91712215","display_name":"Saarland University","ror":"https://ror.org/01jdpyv68","country_code":"DE","type":"education","lineage":["https://openalex.org/I91712215"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Markus Bl\u00e4ser","raw_affiliation_strings":["Saarland University, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Saarland University, Germany","institution_ids":["https://openalex.org/I91712215"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I94624287","display_name":"University of Twente","ror":"https://ror.org/006hf6230","country_code":"NL","type":"education","lineage":["https://openalex.org/I94624287"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["University of Twente, The Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Twente, The Netherlands","institution_ids":["https://openalex.org/I94624287"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7058,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.74541532,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"7","issue":"2","first_page":"1","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10374","display_name":"Advanced Graph Theory Research","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.9988999962806702,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9977999925613403,"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/computational-complexity-theory","display_name":"Computational complexity theory","score":0.5577558875083923},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5494151711463928},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5087845921516418},{"id":"https://openalex.org/keywords/embedding","display_name":"Embedding","score":0.4905173182487488},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.4572553038597107},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4534100294113159},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.43272486329078674},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.41998013854026794},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4189907908439636},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4157281517982483},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4100792407989502},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.11660996079444885}],"concepts":[{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.5577558875083923},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5494151711463928},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5087845921516418},{"id":"https://openalex.org/C41608201","wikidata":"https://www.wikidata.org/wiki/Q980509","display_name":"Embedding","level":2,"score":0.4905173182487488},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.4572553038597107},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4534100294113159},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.43272486329078674},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.41998013854026794},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4189907908439636},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4157281517982483},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4100792407989502},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.11660996079444885},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2656210","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2656210","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:publications/c7dabcbf-8c11-4e0b-92d1-c45117712c91","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/c7dabcbf-8c11-4e0b-92d1-c45117712c91","pdf_url":"https://ris.utwente.nl/ws/files/6722279/SmoothedComp_Journal.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bl\u00e4ser, M & Manthey, B 2015, 'Smoothed Complexity Theory', ACM transactions on computation theory, vol. 7, no. 2, pp. 6. https://doi.org/10.1145/2656210","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/aa1ca388-4dc8-4980-9f27-1689154e4959","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/aa1ca388-4dc8-4980-9f27-1689154e4959","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:ris.utwente.nl:publications/c7dabcbf-8c11-4e0b-92d1-c45117712c91","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:publications/c7dabcbf-8c11-4e0b-92d1-c45117712c91","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/c7dabcbf-8c11-4e0b-92d1-c45117712c91","pdf_url":"https://ris.utwente.nl/ws/files/6722279/SmoothedComp_Journal.pdf","source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","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":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bl\u00e4ser, M & Manthey, B 2015, 'Smoothed Complexity Theory', ACM transactions on computation theory, vol. 7, no. 2, pp. 6. https://doi.org/10.1145/2656210","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2171116055.pdf","grobid_xml":"https://content.openalex.org/works/W2171116055.grobid-xml"},"referenced_works_count":53,"referenced_works":["https://openalex.org/W63574446","https://openalex.org/W109020964","https://openalex.org/W1495051890","https://openalex.org/W1501377049","https://openalex.org/W1527197079","https://openalex.org/W1552810675","https://openalex.org/W1638203394","https://openalex.org/W1923505183","https://openalex.org/W1928413254","https://openalex.org/W1965102305","https://openalex.org/W1965978641","https://openalex.org/W1982562599","https://openalex.org/W1987178221","https://openalex.org/W1995725694","https://openalex.org/W2011039300","https://openalex.org/W2012464972","https://openalex.org/W2021008772","https://openalex.org/W2021384638","https://openalex.org/W2029013046","https://openalex.org/W2029151602","https://openalex.org/W2031958534","https://openalex.org/W2034053794","https://openalex.org/W2054137313","https://openalex.org/W2057913812","https://openalex.org/W2064782937","https://openalex.org/W2079748523","https://openalex.org/W2081026687","https://openalex.org/W2088272899","https://openalex.org/W2098375959","https://openalex.org/W2098712873","https://openalex.org/W2100008268","https://openalex.org/W2104021948","https://openalex.org/W2107993699","https://openalex.org/W2113600113","https://openalex.org/W2122140789","https://openalex.org/W2126882231","https://openalex.org/W2144476828","https://openalex.org/W2154714154","https://openalex.org/W2156369551","https://openalex.org/W2156553179","https://openalex.org/W2157661221","https://openalex.org/W2166752738","https://openalex.org/W2170959740","https://openalex.org/W2173249896","https://openalex.org/W2493827104","https://openalex.org/W2504042522","https://openalex.org/W2561675875","https://openalex.org/W2785713573","https://openalex.org/W2987042746","https://openalex.org/W3022308742","https://openalex.org/W3029201735","https://openalex.org/W3100678396","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W4287372456","https://openalex.org/W3123395501","https://openalex.org/W1759995226","https://openalex.org/W2925112333","https://openalex.org/W2962367815","https://openalex.org/W2040347389","https://openalex.org/W4299305030","https://openalex.org/W4288409376","https://openalex.org/W1594413440","https://openalex.org/W3190027049"],"abstract_inverted_index":{"Smoothed":[0,62],"analysis":[1,20,35,63,71,83,95],"is":[2,64,90,101],"a":[3,38,47,65,113],"new":[4],"way":[5],"of":[6,46,60,67,75,84,93],"analyzing":[7],"algorithms":[8,86],"introduced":[9],"by":[10],"Spielman":[11],"and":[12,28,69,72,87,123,132,134],"Teng.":[13],"Classical":[14],"methods":[15],"like":[16],"worst-case":[17,32,68],"or":[18,33],"average-case":[19,34,70],"have":[21],"accompanying":[22],"complexity":[23,50,98,117],"classes,":[24,122],"such":[25],"as":[26],"P":[27],"Avg-P,":[29],"respectively.":[30],"Whereas":[31],"give":[36],"us":[37,53],"means":[39],"to":[40,54,103,107],"talk":[41,55],"about":[42,56],"the":[43,57,82,120],"running":[44],"time":[45],"particular":[48],"algorithm,":[49],"classes":[51],"allow":[52],"inherent":[58],"difficulty":[59],"problems.":[61],"hybrid":[66],"compensates":[73],"some":[74,125],"their":[76,108],"drawbacks.":[77],"Despite":[78],"its":[79],"success":[80],"for":[81,115],"single":[85],"problems,":[88,139],"there":[89],"no":[91],"embedding":[92],"smoothed":[94,116],"into":[96],"computational":[97],"theory,":[99,118],"which":[100],"necessary":[102],"classify":[104],"problems":[105],"according":[106],"intrinsic":[109],"difficulty.":[110],"We":[111],"propose":[112],"framework":[114],"define":[119],"relevant":[121],"prove":[124],"first":[126],"hardness":[127],"results":[128,136],"(of":[129],"bounded":[130],"halting":[131],"tiling)":[133],"tractability":[135],"(binary":[137],"optimization":[138],"graph":[140],"coloring,":[141],"satisfiability)":[142],"within":[143],"this":[144],"framework.":[145]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}