A Finite Alternation Result for Reversible Boolean Circuits

被引：0

作者：

Selinger, Peter ^{[1
]}

机构：

[1] Dalhousie Univ, Halifax, NS, Canada

来源：

REVERSIBLE COMPUTATION, RC 2016 | 2016年 / 9720卷

关键词：

D O I：

10.1007/978-3-319-40578-0_20

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We say that a reversible boolean function on n bits has alternation depth d if it can be written as the sequential composition of d reversible boolean functions, each of which acts only on the top n - 1 bits or on the bottom n - 1 bits. We show that every reversible boolean function of n >= 4 bits has alternation depth 9.

引用

页码：271 / 285

页数：15

共 50 条

[1] A finite alternation result for reversible boolean circuits
Selinger, Peter
SCIENCE OF COMPUTER PROGRAMMING, 2018, 151 : 2 - 17
[2] ATPG for Reversible Circuits Using Simulation, Boolean Satisfiability, and Pseudo Boolean Optimization
Wille, Robert
Zhang, Hongyan
Drechsler, Rolf
2011 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI), 2011, : 120 - 125
[3] REDUCING QUANTUM COST OF REVERSIBLE CIRCUITS FOR HOMOGENEOUS BOOLEAN FUNCTIONS
Younes, Ahmed
JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2010, 19 (07) : 1423 - 1434
[4] Determining Minimal Testsets for Reversible Circuits Using Boolean Satisfiability
Zhang, Hongyan
Frehse, Stefan
Wille, Robert
Drechsler, Rolf
IEEE AFRICON 2011, 2011,
[5] Reversible modified reconstructability analysis of Boolean circuits and its quantum computation
Al-Rabadi, AN
Zwick, M
KYBERNETES, 2004, 33 (5-6) : 921 - 932
[6] An Algorithm for Minimization of Boolean Functions in the Class of Toffoli Reversible Logic Circuits
Frantseva, Anastasiya
BULLETIN OF IRKUTSK STATE UNIVERSITY-SERIES MATHEMATICS, 2018, 25 : 144 - 158
[7] Complexity of Representations of Multiple-Output Boolean Functions in the Reversible Logic Circuits
Vinokurov, S. F.
Frantseva, A. S.
PROCEEDINGS OF THE XIX IEEE INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND MEASUREMENTS (SCM 2016), 2016, : 374 - 376
[8] Termination of rewriting on reversible Boolean circuits as a free 3-category problem
Barile, Adriano
Berardi, Stefano
Roversi, Luca
THEORETICAL COMPUTER SCIENCE, 2025, 1028
[9] Fault tolerant reversible finite field arithmetic circuits
Mathew, Jimson
Singh, Jawar
Abu Taleb, Anas
Pradhan, Dhiraj K.
14TH IEEE INTERNATIONAL ON-LINE TESTING SYMPOSIUM, PROCEEDINGS, 2008, : 188 - 189
[10] Lower bounds for complexity of Boolean circuits of finite depth with arbitrary elements
Cherukhin, D. Yu.
DISCRETE MATHEMATICS AND APPLICATIONS, 2011, 21 (04): : 499 - 508

← 1 2 3 4 5 →