The Isomorphism Problem for Read-Once Branching Programs and Arithmetic Circuits.
Thomas ThieraufPublished in: Chic. J. Theor. Comput. Sci. (1998)
Keyphrases
- high speed
- graph isomorphism
- delay insensitive
- analog circuits
- graph theory
- max sat
- circuit design
- arithmetic operations
- read once formulas
- analog vlsi
- pruning algorithms
- logic circuits
- digital circuits
- asynchronous circuits
- neural network
- logic synthesis
- constraint satisfaction problems
- objective function
- learning algorithm