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

Theor. Comput. Sci.最新文献

筛选
英文 中文
Smallest number of vertices in a 2-arc-strong digraph without good pairs 没有好对的2-弧强有向图中的最小顶点数
Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.024
Ran Gu, G. Gutin, Shasha Li, Yongtang Shi, Z. Taoqiu
{"title":"Smallest number of vertices in a 2-arc-strong digraph without good pairs","authors":"Ran Gu, G. Gutin, Shasha Li, Yongtang Shi, Z. Taoqiu","doi":"10.1016/j.tcs.2022.09.024","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.09.024","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"102 1","pages":"148-171"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90650705","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
Special issue on Theoretical Topics in Graph Transformation 图变换理论专题特刊
Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.08.015
F. Gadducci, Timo Kehrer
{"title":"Special issue on Theoretical Topics in Graph Transformation","authors":"F. Gadducci, Timo Kehrer","doi":"10.1016/j.tcs.2022.08.015","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.015","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"18 1","pages":"155-156"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"89905123","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
Reasoning about block-based cloud storage systems via separation logic 通过分离逻辑对基于块的云存储系统进行推理
Theor. Comput. Sci. Pub Date : 2022-09-01 DOI: 10.1016/j.tcs.2022.09.015
Zhao Jin, Bowen Zhang, Tianyue Cao, Yongzhi Cao, Hanpin Wang
{"title":"Reasoning about block-based cloud storage systems via separation logic","authors":"Zhao Jin, Bowen Zhang, Tianyue Cao, Yongzhi Cao, Hanpin Wang","doi":"10.1016/j.tcs.2022.09.015","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.09.015","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"7 1","pages":"43-76"},"PeriodicalIF":0.0,"publicationDate":"2022-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74824098","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
Recognizing DAGs with Page-Number 2 is NP-complete 识别Page-Number为2的dag是np完全的
Theor. Comput. Sci. Pub Date : 2022-08-29 DOI: 10.48550/arXiv.2208.13615
M. Bekos, G. D. Lozzo, Fabrizio Frati, Martin Gronemann, T. Mchedlidze, Chrysanthi N. Raftopoulou
{"title":"Recognizing DAGs with Page-Number 2 is NP-complete","authors":"M. Bekos, G. D. Lozzo, Fabrizio Frati, Martin Gronemann, T. Mchedlidze, Chrysanthi N. Raftopoulou","doi":"10.48550/arXiv.2208.13615","DOIUrl":"https://doi.org/10.48550/arXiv.2208.13615","url":null,"abstract":"The page-number of a directed acyclic graph (a DAG, for short) is the minimum $k$ for which the DAG has a topological order and a $k$-coloring of its edges such that no two edges of the same color cross, i.e., have alternating endpoints along the topological order. In 1999, Heath and Pemmaraju conjectured that the recognition of DAGs with page-number $2$ is NP-complete and proved that recognizing DAGs with page-number $6$ is NP-complete [SIAM J. Computing, 1999]. Binucci et al. recently strengthened this result by proving that recognizing DAGs with page-number $k$ is NP-complete, for every $kgeq 3$ [SoCG 2019]. In this paper, we finally resolve Heath and Pemmaraju's conjecture in the affirmative. In particular, our NP-completeness result holds even for $st$-planar graphs and planar posets.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"27 1","pages":"113689"},"PeriodicalIF":0.0,"publicationDate":"2022-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85133956","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
The Kolmogorov Birthday Paradox 柯尔莫哥洛夫生日悖论
Theor. Comput. Sci. Pub Date : 2022-08-24 DOI: 10.48550/arXiv.2208.11237
Samuel Epstein
{"title":"The Kolmogorov Birthday Paradox","authors":"Samuel Epstein","doi":"10.48550/arXiv.2208.11237","DOIUrl":"https://doi.org/10.48550/arXiv.2208.11237","url":null,"abstract":"We prove a Kolmogorov complexity variant of the birthday paradox. Sufficiently sized random subsets of strings are guaranteed to have two members x and y with low K(x/y). To prove this, we first show that the minimum conditional Kolmogorov complexity between members of finite sets is very low if they are not exotic. Exotic sets have high mutual information with the halting sequence.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"19 1","pages":"113964"},"PeriodicalIF":0.0,"publicationDate":"2022-08-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87457373","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 Adaptive Submodular Maximization 流式自适应子模块最大化
Theor. Comput. Sci. Pub Date : 2022-08-17 DOI: 10.48550/arXiv.2208.08021
Shaojie Tang, Jing Yuan
{"title":"Streaming Adaptive Submodular Maximization","authors":"Shaojie Tang, Jing Yuan","doi":"10.48550/arXiv.2208.08021","DOIUrl":"https://doi.org/10.48550/arXiv.2208.08021","url":null,"abstract":"Many sequential decision making problems can be formulated as an adaptive submodular maximization problem. However, most of existing studies in this field focus on pool-based setting, where one can pick items in any order, and there have been few studies for the stream-based setting where items arrive in an arbitrary order and one must immediately decide whether to select an item or not upon its arrival. In this paper, we introduce a new class of utility functions, semi-policywise submodular functions. We develop a series of effective algorithms to maximize a semi-policywise submodular function under the stream-based setting.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"6 1","pages":"113644"},"PeriodicalIF":0.0,"publicationDate":"2022-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"73024799","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
An effective parameter tuned deep belief network for detecting anomalous behavior in sensor-based cyber-physical systems 基于传感器的网络物理系统异常行为检测的有效参数调优深度信念网络
Theor. Comput. Sci. Pub Date : 2022-08-01 DOI: 10.1016/j.tcs.2022.07.037
S. K. Narayanan, S. Dhanasekaran, V. Vasudevan
{"title":"An effective parameter tuned deep belief network for detecting anomalous behavior in sensor-based cyber-physical systems","authors":"S. K. Narayanan, S. Dhanasekaran, V. Vasudevan","doi":"10.1016/j.tcs.2022.07.037","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.07.037","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"57 5 1","pages":"142-151"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"77750780","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
A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems 大型多处理机系统中顶点局部可诊断的一种新结构
Theor. Comput. Sci. Pub Date : 2022-08-01 DOI: 10.1016/j.tcs.2022.08.020
Meirun Chen, D. Hsu, Cheng-Kuan Lin
{"title":"A new structure for a vertex to be locally t-diagnosable in large multiprocessor systems","authors":"Meirun Chen, D. Hsu, Cheng-Kuan Lin","doi":"10.1016/j.tcs.2022.08.020","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.020","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"47 1","pages":"81-90"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74804429","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
Monochromatic arithmetic progressions in binary Thue-Morse-like words 二进制类thue - morse字中的单色算术数列
Theor. Comput. Sci. Pub Date : 2022-08-01 DOI: 10.1016/j.tcs.2022.08.013
Ibai Aedo, U. Grimm, Yasushi Nagai, Petra Staynova
{"title":"Monochromatic arithmetic progressions in binary Thue-Morse-like words","authors":"Ibai Aedo, U. Grimm, Yasushi Nagai, Petra Staynova","doi":"10.1016/j.tcs.2022.08.013","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.013","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"47 1","pages":"65-80"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85846163","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}
引用次数: 3
Monotonic self-stabilization and its application to robust and adaptive pattern formation 单调自稳定及其在鲁棒自适应模式形成中的应用
Theor. Comput. Sci. Pub Date : 2022-08-01 DOI: 10.1016/j.tcs.2022.08.011
Y. Asahiro, I. Suzuki, M. Yamashita
{"title":"Monotonic self-stabilization and its application to robust and adaptive pattern formation","authors":"Y. Asahiro, I. Suzuki, M. Yamashita","doi":"10.1016/j.tcs.2022.08.011","DOIUrl":"https://doi.org/10.1016/j.tcs.2022.08.011","url":null,"abstract":"","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"31 1","pages":"21-46"},"PeriodicalIF":0.0,"publicationDate":"2022-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90364347","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
首页 上一页 下一页 尾页
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学术官方微信