{"id":"https://openalex.org/W1608747669","doi":null,"title":"On probabilistic proof systems and hardness of approximation","display_name":"On probabilistic proof systems and hardness of approximation","publication_year":2002,"publication_date":"2002-01-01","ids":{"openalex":"https://openalex.org/W1608747669","mag":"1608747669"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.5756","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/~joho/thesis.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5037246013","display_name":"Jonas Holmerin","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Jonas Holmerin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5037246013"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4324,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.56850179,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9951000213623047,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.002300000051036477,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.0003000000142492354,"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/hardness-of-approximation","display_name":"hardness of approximation","score":0.9879999756813049},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.9520000219345093},{"id":"https://openalex.org/keywords/np-complete-problems","display_name":"NP-complete problems","score":0.9610000252723694},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8199999928474426},{"id":"https://openalex.org/keywords/p-versus-np","display_name":"P versus NP","score":0.5509999990463257}],"concepts":[{"id":"https://openalex.org/C112955886","wikidata":"https://www.wikidata.org/wiki/Q5656275","display_name":"Hardness of approximation","level":3,"score":0.6417427659034729},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.6393908858299255},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6208420991897583},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6206634044647217},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.5881307125091553},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5733900666236877},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5200471878051758},{"id":"https://openalex.org/C13355873","wikidata":"https://www.wikidata.org/wiki/Q2920850","display_name":"Connection (principal bundle)","level":2,"score":0.47268539667129517},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.4594515264034271},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45330652594566345},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4365023970603943},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4243497848510742},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.10.5756","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.5756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.nada.kth.se/~joho/thesis.ps","raw_type":"text"},{"id":"mag:1608747669","doi":null,"is_oa":false,"landing_page_url":"http://www.csc.kth.se/~joho/thesis.pdf","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W113175115","https://openalex.org/W132909967","https://openalex.org/W1546177704","https://openalex.org/W1549252969","https://openalex.org/W1549730417","https://openalex.org/W1564025554","https://openalex.org/W1626141149","https://openalex.org/W1869394087","https://openalex.org/W1899212464","https://openalex.org/W1967935161","https://openalex.org/W1970259241","https://openalex.org/W1971749164","https://openalex.org/W1975442866","https://openalex.org/W1985123706","https://openalex.org/W1992866589","https://openalex.org/W2001663593","https://openalex.org/W2003159902","https://openalex.org/W2011039300","https://openalex.org/W2019578639","https://openalex.org/W2028146521","https://openalex.org/W2036265926","https://openalex.org/W2040924621","https://openalex.org/W2068871408","https://openalex.org/W2069816168","https://openalex.org/W2072802070","https://openalex.org/W2074555287","https://openalex.org/W2081254453","https://openalex.org/W2082647621","https://openalex.org/W2086653003","https://openalex.org/W2091921997","https://openalex.org/W2096367977","https://openalex.org/W2097206148","https://openalex.org/W2125278290","https://openalex.org/W2126331452","https://openalex.org/W2132991500","https://openalex.org/W2133344054","https://openalex.org/W2139689595","https://openalex.org/W2143996311","https://openalex.org/W2146489710","https://openalex.org/W2148352980","https://openalex.org/W2157948169","https://openalex.org/W2160033075","https://openalex.org/W2166366531","https://openalex.org/W2171696779","https://openalex.org/W2173464082","https://openalex.org/W2202947145","https://openalex.org/W2293988196","https://openalex.org/W2596306356","https://openalex.org/W2891212941","https://openalex.org/W3004537778"],"related_works":["https://openalex.org/W7099835750","https://openalex.org/W1595252626","https://openalex.org/W7099566069","https://openalex.org/W2029830880","https://openalex.org/W2402012677","https://openalex.org/W35584922","https://openalex.org/W7100928498","https://openalex.org/W7100877079","https://openalex.org/W7097951413","https://openalex.org/W2143391442"],"abstract_inverted_index":{"In":[0],"this":[1],"thesis":[2],"we":[3],"study":[4],"the":[5,59],"approximability":[6],"of":[7],"combinatorial":[8],"optimization":[9],"problems":[10,17],"whose":[11,53],"decision":[12],"versions":[13],"are":[14],"NP-complete.":[15],"These":[16],"cannot":[18],"be":[19,32],"solved":[20],"exactly":[21],"in":[22,38],"polynomial":[23,39,46],"time,":[24,40],"unless":[25],"P":[26],"=":[27],"NP.":[28],"However,":[29],"it":[30],"may":[31],"possible":[33],"to":[34,58],"solve":[35],"them":[36],"approximately":[37],"i.e.,":[41],"there":[42],"might":[43],"exist":[44],"a":[45,51],"time":[47],"algorithm":[48],"which":[49],"produces":[50],"solution":[52],"value":[54],"is":[55],"always":[56],"close":[57],"optimum.":[60],"An":[61],"important":[62]},"counts_by_year":[],"updated_date":"2026-09-26T08:19:03.415552","created_date":"2016-06-24T00:00:00"}