{"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}
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.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
