Depth Lower Bounds against Circuits with Sparse Orientation.
Sajin KorothJayalal SarmaPublished in: Fundam. Informaticae (2017)
Keyphrases
- lower bound
- upper bound
- branch and bound
- objective function
- branch and bound algorithm
- np hard
- depth information
- high dimensional
- depth map
- worst case
- high speed
- lower and upper bounds
- upper and lower bounds
- delay insensitive
- gabor filters
- sparse data
- logic synthesis
- set of randomly generated instances
- logic circuits
- analog circuits
- digital circuits
- quadratic assignment problem
- depth images
- sparse representation
- optimal solution