Chris Bourke, Raghunath Tewari, N. V. Vinodchandran
{"title":"无二义对数空间中的有向平面可达性","authors":"Chris Bourke, Raghunath Tewari, N. V. Vinodchandran","doi":"10.1145/1490270.1490274","DOIUrl":null,"url":null,"abstract":"We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.","PeriodicalId":175854,"journal":{"name":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"76","resultStr":"{\"title\":\"Directed Planar Reachability is in Unambiguous Log-Space\",\"authors\":\"Chris Bourke, Raghunath Tewari, N. V. Vinodchandran\",\"doi\":\"10.1145/1490270.1490274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We show that the st-connectivity problem for directed planar graphs can be decided in unambiguous logarithmic space.\",\"PeriodicalId\":175854,\"journal\":{\"name\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"volume\":\"34 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-13\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"76\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/1490270.1490274\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/1490270.1490274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
