{"title":"偏序的复杂度","authors":"J. Munro","doi":"10.1137/1.9781611973020.5","DOIUrl":null,"url":null,"abstract":"We will address several issues, old and new, in the computational complexity of comparison based problems, focusing on the long term development of techniques. Most notably, we will look at the comparison minimization problems of placing a set of n values into an arbitrary given partial order, and of completing the sort from this stage. The parallel development of the algorithmics and of graph entropy will be discussed in this context.","PeriodicalId":340112,"journal":{"name":"Workshop on Analytic Algorithmics and Combinatorics","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"The Complexity of Partial Orders\",\"authors\":\"J. Munro\",\"doi\":\"10.1137/1.9781611973020.5\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We will address several issues, old and new, in the computational complexity of comparison based problems, focusing on the long term development of techniques. Most notably, we will look at the comparison minimization problems of placing a set of n values into an arbitrary given partial order, and of completing the sort from this stage. The parallel development of the algorithmics and of graph entropy will be discussed in this context.\",\"PeriodicalId\":340112,\"journal\":{\"name\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"volume\":\"9 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-01-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Workshop on Analytic Algorithmics and Combinatorics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1137/1.9781611973020.5\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Workshop on Analytic Algorithmics and Combinatorics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1137/1.9781611973020.5","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We will address several issues, old and new, in the computational complexity of comparison based problems, focusing on the long term development of techniques. Most notably, we will look at the comparison minimization problems of placing a set of n values into an arbitrary given partial order, and of completing the sort from this stage. The parallel development of the algorithmics and of graph entropy will be discussed in this context.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
