On Lifting Lower Bounds for Noncommutative Circuits using Automata.
V. ArvindAbhranil ChatterjeePublished in: CoRR (2023)
Keyphrases
- lower bound
- upper bound
- branch and bound algorithm
- branch and bound
- wavelet transform
- cellular automata
- np hard
- lower bounding
- lower and upper bounds
- objective function
- delay insensitive
- finite automata
- lattice gas
- high speed
- finite state machines
- quadratic assignment problem
- analog circuits
- asynchronous circuits
- optimal cost
- optimal solution
- finite state
- vc dimension
- circuit design
- worst case
- probabilistic automata
- multiresolution
- quantum computing
- set of randomly generated instances
- analog vlsi
- turing machine
- digital circuits
- upper and lower bounds
- online algorithms
- tunnel diode
- sample complexity