Improved Lower and Upper Bounds on the Tile Complexity of Uniquely Self-Assembling a Thin Rectangle Non-Cooperatively in 3D

IF 0.6 4区计算机科学 Q4 COMPUTER SCIENCE, THEORY & METHODS

Theory of Computing Systems Pub Date : 2023-08-23 DOI:10.1007/s00224-023-10137-9

David Furcy, Scott M. Summers, Logan Withers

引用次数: 2

Abstract Image

查看原文本刊更多论文

改进的三维非合作薄型矩形唯一自组装贴图复杂度下界和上界

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theory of Computing Systems 工程技术-计算机：理论方法

CiteScore

1.90

自引率

0.00%

发文量

审稿时长

6-12 weeks

期刊介绍： TOCS is devoted to publishing original research from all areas of theoretical computer science, ranging from foundational areas such as computational complexity, to fundamental areas such as algorithms and data structures, to focused areas such as parallel and distributed algorithms and architectures.