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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
The Effect of Homogeneity on the Complexity of k-Anonymity 同质性对k-匿名复杂性的影响
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_5
Robert Bredereck, A. Nichterlein, R. Niedermeier, Geevarghese Philip
{"title":"The Effect of Homogeneity on the Complexity of k-Anonymity","authors":"Robert Bredereck, A. Nichterlein, R. Niedermeier, Geevarghese Philip","doi":"10.1007/978-3-642-22953-4_5","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_5","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122015198","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}
引用次数: 9
Almost Transparent Short Proofs for NPℝ NP的几乎透明的简短证明
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_4
K. Meer
{"title":"Almost Transparent Short Proofs for NPℝ","authors":"K. Meer","doi":"10.1007/978-3-642-22953-4_4","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_4","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"78 7","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120977161","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}
引用次数: 4
On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems 强连通迭代图与混沌布尔离散动力系统的联系
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_11
J. Bahi, Jean-François Couchot, C. Guyeux, A. Richard
{"title":"On the Link between Strongly Connected Iteration Graphs and Chaotic Boolean Discrete-Time Dynamical Systems","authors":"J. Bahi, Jean-François Couchot, C. Guyeux, A. Richard","doi":"10.1007/978-3-642-22953-4_11","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_11","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"39 4","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121009272","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}
引用次数: 16
Dag Realizations of Directed Degree Sequences 有向度序列的Dag实现
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_23
A. Berger, M. Müller-Hannemann
{"title":"Dag Realizations of Directed Degree Sequences","authors":"A. Berger, M. Müller-Hannemann","doi":"10.1007/978-3-642-22953-4_23","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_23","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125265545","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}
引用次数: 8
Computational Randomness from Generalized Hardcore Sets 广义核核集的计算随机性
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_7
Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai
{"title":"Computational Randomness from Generalized Hardcore Sets","authors":"Chia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai","doi":"10.1007/978-3-642-22953-4_7","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_7","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129935155","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
Kernelization: An Overview 内核化:概述
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_3
D. Lokshtanov
{"title":"Kernelization: An Overview","authors":"D. Lokshtanov","doi":"10.1007/978-3-642-22953-4_3","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_3","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126526580","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}
引用次数: 2
Virtual Substitution for SMT-Solving smt求解的虚拟替代
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_31
Florian Corzilius, E. Ábrahám
{"title":"Virtual Substitution for SMT-Solving","authors":"Florian Corzilius, E. Ábrahám","doi":"10.1007/978-3-642-22953-4_31","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_31","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"161 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116890351","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}
引用次数: 18
Hunting Distributed Malware with the κ-Calculus 利用κ-演算查找分布式恶意软件
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_9
M. Preda, C. Giusto
{"title":"Hunting Distributed Malware with the κ-Calculus","authors":"M. Preda, C. Giusto","doi":"10.1007/978-3-642-22953-4_9","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_9","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129914775","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}
引用次数: 10
Principal Types for Nominal Theories 名义理论的主要类型
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_14
Elliot Fairweather, M. Fernández, M. Gabbay
{"title":"Principal Types for Nominal Theories","authors":"Elliot Fairweather, M. Fernández, M. Gabbay","doi":"10.1007/978-3-642-22953-4_14","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_14","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121203628","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}
引用次数: 7
Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes 表征非均匀复杂性类的简洁代数分支程序
International Symposium on Fundamentals of Computation Theory Pub Date : 2011-08-22 DOI: 10.1007/978-3-642-22953-4_18
Guillaume Malod
{"title":"Succinct Algebraic Branching Programs Characterizing Non-uniform Complexity Classes","authors":"Guillaume Malod","doi":"10.1007/978-3-642-22953-4_18","DOIUrl":"https://doi.org/10.1007/978-3-642-22953-4_18","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122572795","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}
引用次数: 8
首页 上一页
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学术官方微信