SIGACT新闻复杂性理论专栏

SIGACT News Pub Date : 2018-10-24 DOI:10.1145/3289137.3289147

L. Hemaspaandra

{"title":"SIGACT新闻复杂性理论专栏","authors":"L. Hemaspaandra","doi":"10.1145/3289137.3289147","DOIUrl":null,"url":null,"abstract":"To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.","PeriodicalId":22106,"journal":{"name":"SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2018-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"SIGACT News Complexity Theory Column 99\",\"authors\":\"L. Hemaspaandra\",\"doi\":\"10.1145/3289137.3289147\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.\",\"PeriodicalId\":22106,\"journal\":{\"name\":\"SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3289137.3289147\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3289137.3289147","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

把这些论文称为潜在的是一种滑稽的轻描淡写。事实上，这些论文所做的是帮助建立理论计算机科学发展的框架。约简可能是理论计算机科学将一个问题的复杂性与另一个问题联系起来的最核心的方式，这两篇论文在很大程度上雕刻并有力地探索了多项式时间和对数空间约简的景观。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

SIGACT News Complexity Theory Column 99

To call these papers in uential would be a comic understatement. In fact, what these papers did is to help set the framework in which theoretical computer science would grow. Reductions are perhaps the most central way in which theoretical computer science relates one problem's complexity to another, and these two papers largely sculpted and powerfully explored the landscape of both polynomial-time and logspace reductions.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

SIGACT News

自引率

0.00%

发文量