On Lifting Lower Bounds for Noncommutative Circuits using Automata.
Vikraman ArvindAbhranil ChatterjeePublished in: Electron. Colloquium Comput. Complex. (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound
- cellular automata
- finite automata
- branch and bound algorithm
- np hard
- high speed
- wavelet transform
- optimal solution
- delay insensitive
- finite state machines
- probabilistic automata
- finite state
- logic synthesis
- quadratic assignment problem
- upper and lower bounds
- objective function
- worst case
- tunnel diode
- cutting plane
- digital circuits
- lower bounding
- tree automata
- optimal cost
- lattice gas
- set of randomly generated instances
- electronic circuits
- asynchronous circuits
- circuit design
- regular expressions
- quantum computing
- analog circuits
- online algorithms
- concept class