Theor. Comput. Sci.最新文献_第6页

Delay-Constrained Minimum Shortest Path Trees and Related Problems 时滞约束最小最短路径树及其相关问题

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.1007/978-3-030-92681-6_53

Junran Lichen, Lijian Cai, Jianping Li, Suding Liu, Pengxiang Pan, Wencheng Wang

引用次数: 2

A parallel algorithm to construct edge independent spanning trees on the line graphs of conditional bijective connection networks 一种在条件双射连接网络线图上构造边无关生成树的并行算法

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.2139/ssrn.4111842

Z. Pan, B. Cheng, Jianxi Fan, Yan Wang, Xiajing Li

引用次数: 3

New Approximation Algorithms for the Rooted Budgeted Cycle Cover Problem 根预算周期覆盖问题的新逼近算法

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.1007/978-3-030-92681-6_14

Jiang-Ni Li, Peng Zhang

引用次数: 1

Approximation Algorithms for Two Parallel Dedicated Machine Scheduling with Conflict Constraints 冲突约束下两台并行专用机调度的逼近算法

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.1007/978-3-030-92681-6_10

An Zhang, Liangying Zhang, Yong Chen, Guangting Chen, Xing Wang

引用次数: 1

Complexity and approximability of Minimum Path-Collection Exact Covers 最小路径集精确覆盖的复杂性和近似性

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.2139/ssrn.4072697

S. V. Ravelo, Cristina G. Fernandes

引用次数: 0

Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity 有时Kolmogorov复杂度投影下的密码硬度

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.4230/LIPIcs.ISAAC.2021.54

E. Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle

{"title":"Cryptographic Hardness under Projections for Time-Bounded Kolmogorov Complexity","authors":"E. Allender, John Gouwar, Shuichi Hirahara, Caleb Robelle","doi":"10.4230/LIPIcs.ISAAC.2021.54","DOIUrl":"https://doi.org/10.4230/LIPIcs.ISAAC.2021.54","url":null,"abstract":"A version of time-bounded Kolmogorov complexity, denoted KT , has received attention in the past several years, due to its close connection to circuit complexity and to the Minimum Circuit Size Problem MCSP . Essentially all results about the complexity of MCSP hold also for MKTP (the problem of computing the KT complexity of a string). Both MKTP and MCSP are hard for SZK (Statistical Zero Knowledge) under BPP -Turing reductions; neither is known to be NP -complete. Recently, some hardness results for MKTP were proved that are not (yet) known to hold for MCSP . In particular, MKTP is hard for DET (a subclass of P ) under nonuniform ≤ NC 0 m reductions. In this paper, we improve this, to show that MKTP is hard for the (apparently larger) class NISZK L under not only ≤ NC 0 m reductions but even under projections. Also MKTP is hard for NISZK under ≤ P / poly m reductions. Here, NISZK is the class of problems with non-interactive zero-knowledge proofs, and NISZK L is the non-interactive version of the class SZK L that was studied by Dvir et al. As an application, we provide several improved worst-case to average-case reductions to problems in NP , and we obtain a new lower bound on MKTP (which is currently not known to hold for MCSP ).","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"23 1","pages":"206-224"},"PeriodicalIF":0.0,"publicationDate":"2022-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87023935","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

Approximate Distance Oracles with Improved Stretch for Sparse Graphs 基于改进拉伸的稀疏图近似距离预言机

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.1007/978-3-030-89543-3_8

L. Roditty, Roei Tov

引用次数: 3

Mathematical Characterizations and Computational Complexity of Anti-slide Puzzles 抗滑拼图的数学特征和计算复杂度

Theor. Comput. Sci. Pub Date : 2022-11-01 DOI: 10.1007/978-3-030-68211-8_26

Ko Minamisawa, Ryuhei Uehara, Masao Hara

引用次数: 1

Plant Disease Detection using Ensembled CNN Framework 利用集成CNN框架进行植物病害检测

Theor. Comput. Sci. Pub Date : 2022-10-02 DOI: 10.7494/csci.2022.23.3.4376

Subhash Mondal, Suharta Banerjee, Subinoy Mukherjee, Diganta Sengupta

引用次数: 0

Automatic Bridge between BPMN Models and UML Activity Diagrams based on Graph Transformation 基于图转换的BPMN模型与UML活动图之间的自动桥接

Theor. Comput. Sci. Pub Date : 2022-10-02 DOI: 10.7494/csci.2022.23.3.4356

Yasmina Rahmoune, A. Chaoui

{"title":"Automatic Bridge between BPMN Models and UML Activity Diagrams based on Graph Transformation","authors":"Yasmina Rahmoune, A. Chaoui","doi":"10.7494/csci.2022.23.3.4356","DOIUrl":"https://doi.org/10.7494/csci.2022.23.3.4356","url":null,"abstract":"Model Driven Engineering (MDE) provides available tools, concepts and languages to create and transform models. One of the most important successes of MDE is model transformation; it permits transforming models used by one community to equivalent models used by another one. Moreover, each community of developers has its own tools for verification, testing and test case generation. Hence, a developer of one community who moves to work with another community needs a transformation process from the second community to (his/her) own community and vice versa. Therefore, the target community can benefit from the expertise of the source one and the developers do not begin from zero.In this context, we propose in this paper an automatic transformation to create a bridge between the BPMN and UML communities. We propose an approach and a visual tool for the automatic transformation of BPMN models to UML Activity Diagrams (UML-AD). The proposed approach is based on Meta-Modeling and Graph Transformation, and uses the AToM3 tool. Indeed, we were inspired by the OMG meta-models of BPMN and UML-AD and implemented versions of both meta-models using AToM3. This last allows generating automatically a visual modeling tool for each proposed meta-model. Based on these two meta-models, we propose a graph grammar composed of sixty rules that perform the transformation process. The proposed approach is illustrated through three case studies.","PeriodicalId":23063,"journal":{"name":"Theor. Comput. Sci.","volume":"16 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84048463","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