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

International Symposium on Fundamentals of Computation Theory最新文献

筛选
英文 中文
On Computing Optimal Temporal Branchings 关于计算最佳时空分支
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-12-18 DOI: 10.1007/978-3-031-43587-4_8
Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Paula Couto da Silva
{"title":"On Computing Optimal Temporal Branchings","authors":"Daniela Bubboloni, Costanza Catalano, Andrea Marino, Ana Paula Couto da Silva","doi":"10.1007/978-3-031-43587-4_8","DOIUrl":"https://doi.org/10.1007/978-3-031-43587-4_8","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"224 S715","pages":"103-117"},"PeriodicalIF":0.0,"publicationDate":"2023-12-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138995100","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
Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata 多项式大小有限自动机非均匀族的计数能力
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-10-29 DOI: 10.1007/978-3-031-43587-4_30
T. Yamakami
{"title":"Power of Counting by Nonuniform Families of Polynomial-Size Finite Automata","authors":"T. Yamakami","doi":"10.1007/978-3-031-43587-4_30","DOIUrl":"https://doi.org/10.1007/978-3-031-43587-4_30","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"6 1","pages":"421-435"},"PeriodicalIF":0.0,"publicationDate":"2023-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139311667","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
Complexity of Conformant Election Manipulation 一致性选举操纵的复杂性
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-07-21 DOI: 10.48550/arXiv.2307.11689
Zack Fitzsimmons, E. Hemaspaandra
{"title":"Complexity of Conformant Election Manipulation","authors":"Zack Fitzsimmons, E. Hemaspaandra","doi":"10.48550/arXiv.2307.11689","DOIUrl":"https://doi.org/10.48550/arXiv.2307.11689","url":null,"abstract":"It is important to study how strategic agents can affect the outcome of an election. There has been a long line of research in the computational study of elections on the complexity of manipulative actions such as manipulation and bribery. These problems model scenarios such as voters casting strategic votes and agents campaigning for voters to change their votes to make a desired candidate win. A common assumption is that the preferences of the voters follow the structure of a domain restriction such as single peakedness, and so manipulators only consider votes that also satisfy this restriction. We introduce the model where the preferences of the voters define their own restriction and strategic actions must ``conform'' by using only these votes. In this model, the election after manipulation will retain common domain restrictions. We explore the computational complexity of conformant manipulative actions and we discuss how conformant manipulative actions relate to other manipulative actions.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128190458","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
Computing Subset Vertex Covers in H-Free Graphs 计算H-Free图中的子集顶点覆盖
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-07-11 DOI: 10.48550/arXiv.2307.05701
Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, D. Paulusma, E. J. V. Leeuwen
{"title":"Computing Subset Vertex Covers in H-Free Graphs","authors":"Nick Brettell, Jelle J. Oostveen, Sukanya Pandey, D. Paulusma, E. J. V. Leeuwen","doi":"10.48550/arXiv.2307.05701","DOIUrl":"https://doi.org/10.48550/arXiv.2307.05701","url":null,"abstract":"We consider a natural generalization of Vertex Cover: the Subset Vertex Cover problem, which is to decide for a graph $G=(V,E)$, a subset $T subseteq V$ and integer $k$, if $V$ has a subset $S$ of size at most $k$, such that $S$ contains at least one end-vertex of every edge incident to a vertex of $T$. A graph is $H$-free if it does not contain $H$ as an induced subgraph. We solve two open problems from the literature by proving that Subset Vertex Cover is NP-complete on subcubic (claw,diamond)-free planar graphs and on $2$-unipolar graphs, a subclass of $2P_3$-free weakly chordal graphs. Our results show for the first time that Subset Vertex Cover is computationally harder than Vertex Cover (under P $neq$ NP). We also prove new polynomial time results. We first give a dichotomy on graphs where $G[T]$ is $H$-free. Namely, we show that Subset Vertex Cover is polynomial-time solvable on graphs $G$, for which $G[T]$ is $H$-free, if $H = sP_1 + tP_2$ and NP-complete otherwise. Moreover, we prove that Subset Vertex Cover is polynomial-time solvable for $(sP_1 + P_2 + P_3)$-free graphs and bounded mim-width graphs. By combining our new results with known results we obtain a partial complexity classification for Subset Vertex Cover on $H$-free graphs.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127026333","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
α-β-Factorization and the Binary Case of Simon's Congruence α-β-分解与西蒙同余的二元情形
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-06-25 DOI: 10.48550/arXiv.2306.14192
Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka
{"title":"α-β-Factorization and the Binary Case of Simon's Congruence","authors":"Pamela Fleischmann, Jonas Höfer, Annika Huch, Dirk Nowotka","doi":"10.48550/arXiv.2306.14192","DOIUrl":"https://doi.org/10.48550/arXiv.2306.14192","url":null,"abstract":"In 1991 H'ebrard introduced a factorization of words that turned out to be a powerful tool for the investigation of a word's scattered factors (also known as (scattered) subwords or subsequences). Based on this, first Karandikar and Schnoebelen introduced the notion of $k$-richness and later on Barker et al. the notion of $k$-universality. In 2022 Fleischmann et al. presented a generalization of the arch factorization by intersecting the arch factorization of a word and its reverse. While the authors merely used this factorization for the investigation of shortest absent scattered factors, in this work we investigate this new $alpha$-$beta$-factorization as such. We characterize the famous Simon congruence of $k$-universal words in terms of $1$-universal words. Moreover, we apply these results to binary words. In this special case, we obtain a full characterization of the classes and calculate the index of the congruence. Lastly, we start investigating the ternary case, present a full list of possibilities for $alphabetaalpha$-factors, and characterize their congruence.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133381897","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
Bounds for c-Ideal Hashing c-理想哈希的界
International Symposium on Fundamentals of Computation Theory Pub Date : 2023-01-31 DOI: 10.48550/arXiv.2301.13832
F. Frei, D. Wehner
{"title":"Bounds for c-Ideal Hashing","authors":"F. Frei, D. Wehner","doi":"10.48550/arXiv.2301.13832","DOIUrl":"https://doi.org/10.48550/arXiv.2301.13832","url":null,"abstract":"In this paper, we analyze hashing from a worst-case perspective. To this end, we study a new property of hash families that is strongly related to d-perfect hashing, namely c-ideality. On the one hand, this notion generalizes the definition of perfect hashing, which has been studied extensively; on the other hand, it provides a direct link to the notion of c-approximativity. We focus on the usually neglected case where the average load alpha is at least 1 and prove upper and lower parametrized bounds on the minimal size of c-ideal hash families. As an aside, we show how c-ideality helps to analyze the advice complexity of hashing. The concept of advice, introduced a decade ago, lets us measure the information content of an online problem. We prove hashing's advice complexity to be linear in the hash table size.","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122453454","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
Streaming Deletion Problems Parameterized by Vertex Cover 用顶点覆盖参数化的流删除问题
International Symposium on Fundamentals of Computation Theory Pub Date : 2021-11-19 DOI: 10.1007/978-3-030-86593-1_29
Jelle J. Oostveen, E. J. V. Leeuwen
{"title":"Streaming Deletion Problems Parameterized by Vertex Cover","authors":"Jelle J. Oostveen, E. J. V. Leeuwen","doi":"10.1007/978-3-030-86593-1_29","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_29","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116416016","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}
引用次数: 1
On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits 关于行列式的硬度:正则集多线性电路和
International Symposium on Fundamentals of Computation Theory Pub Date : 2021-09-21 DOI: 10.1007/978-3-030-86593-1_30
S. Raja, Sumukha Bharadwaj
{"title":"On the Hardness of the Determinant: Sum of Regular Set-Multilinear Circuits","authors":"S. Raja, Sumukha Bharadwaj","doi":"10.1007/978-3-030-86593-1_30","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_30","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"94 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-09-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127981734","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
Computational Complexity of Synchronization under Sparse Regular Constraints 稀疏规则约束下同步的计算复杂度
International Symposium on Fundamentals of Computation Theory Pub Date : 2021-07-30 DOI: 10.1007/978-3-030-86593-1_19
Stefan Hoffmann
{"title":"Computational Complexity of Synchronization under Sparse Regular Constraints","authors":"Stefan Hoffmann","doi":"10.1007/978-3-030-86593-1_19","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_19","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114985851","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}
引用次数: 1
Deciding Top-Down Determinism of Regular Tree Languages 确定规则树语言的自顶向下决定论
International Symposium on Fundamentals of Computation Theory Pub Date : 2021-07-07 DOI: 10.1007/978-3-030-86593-1_24
Peter Leupold, S. Maneth
{"title":"Deciding Top-Down Determinism of Regular Tree Languages","authors":"Peter Leupold, S. Maneth","doi":"10.1007/978-3-030-86593-1_24","DOIUrl":"https://doi.org/10.1007/978-3-030-86593-1_24","url":null,"abstract":"","PeriodicalId":335412,"journal":{"name":"International Symposium on Fundamentals of Computation Theory","volume":"174 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2021-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115723617","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}
引用次数: 1
下一页 尾页
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学术官方微信