Upper bounds for reversible circuits based on Young subgroups.
Nabila AbdessaiedMathias SoekenMichael Kirkedal ThomsenRolf DrechslerPublished in: Inf. Process. Lett. (2014)
Keyphrases
- upper bound
- lower bound
- upper and lower bounds
- tight bounds
- cellular automata
- worst case
- high speed
- lower and upper bounds
- markov chain
- branch and bound
- branch and bound algorithm
- delay insensitive
- young adults
- sample size
- subgroup discovery
- efficiently computable
- electronic circuits
- asynchronous circuits
- generalization error
- upper bounding
- tight upper and lower bounds
- circuit design
- search algorithm
- logic synthesis
- analog vlsi
- quantum computing
- special case
- sample complexity
- reversible watermarking