Lower Bounds on the Area Complexity of Boolean Circuits.
Juraj HromkovicSergej A. LozkinAndrej I. RybkoAlexander A. SapozhenkoNadezda A. SkalikovaPublished in: Theor. Comput. Sci. (1992)
Keyphrases
- lower bound
- upper bound
- worst case
- branch and bound
- objective function
- average case complexity
- complexity measures
- branch and bound algorithm
- np hard
- real valued
- upper and lower bounds
- optimal solution
- decision problems
- special case
- computational complexity
- high speed
- np complete
- lower and upper bounds
- digital circuits
- information retrieval