发布求助
文献互助 智能选刊 最新文献

Parameterized Complexity in the Polynomial Hierarchy最新文献

筛选
英文 中文
Open Problems and Future Research Directions 开放性问题及未来研究方向
Parameterized Complexity in the Polynomial Hierarchy Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-60670-4_16
Ronald de Haan
{"title":"Open Problems and Future Research Directions","authors":"Ronald de Haan","doi":"10.1007/978-3-662-60670-4_16","DOIUrl":"https://doi.org/10.1007/978-3-662-60670-4_16","url":null,"abstract":"","PeriodicalId":287770,"journal":{"name":"Parameterized Complexity in the Polynomial Hierarchy","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116807492","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Problems in Knowledge Representation and Reasoning 知识表示与推理中的问题
Parameterized Complexity in the Polynomial Hierarchy Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-60670-4_8
Ronald de Haan
{"title":"Problems in Knowledge Representation and Reasoning","authors":"Ronald de Haan","doi":"10.1007/978-3-662-60670-4_8","DOIUrl":"https://doi.org/10.1007/978-3-662-60670-4_8","url":null,"abstract":"","PeriodicalId":287770,"journal":{"name":"Parameterized Complexity in the Polynomial Hierarchy","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121740238","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Need for a New Completeness Theory 需要一个新的完备性理论
Parameterized Complexity in the Polynomial Hierarchy Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-60670-4_5
Ronald de Haan
{"title":"The Need for a New Completeness Theory","authors":"Ronald de Haan","doi":"10.1007/978-3-662-60670-4_5","DOIUrl":"https://doi.org/10.1007/978-3-662-60670-4_5","url":null,"abstract":"","PeriodicalId":287770,"journal":{"name":"Parameterized Complexity in the Polynomial Hierarchy","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121901782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph Problems 图的问题
Parameterized Complexity in the Polynomial Hierarchy Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-60670-4_13
Ronald de Haan
{"title":"Graph Problems","authors":"Ronald de Haan","doi":"10.1007/978-3-662-60670-4_13","DOIUrl":"https://doi.org/10.1007/978-3-662-60670-4_13","url":null,"abstract":"","PeriodicalId":287770,"journal":{"name":"Parameterized Complexity in the Polynomial Hierarchy","volume":"61 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129916361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Conclusion 结论
Parameterized Complexity in the Polynomial Hierarchy Pub Date : 1900-01-01 DOI: 10.1007/978-3-662-60670-4_17
Ronald de Haan
{"title":"Conclusion","authors":"Ronald de Haan","doi":"10.1007/978-3-662-60670-4_17","DOIUrl":"https://doi.org/10.1007/978-3-662-60670-4_17","url":null,"abstract":"","PeriodicalId":287770,"journal":{"name":"Parameterized Complexity in the Polynomial Hierarchy","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126234219","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 12
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信