On the Computational Complexity of Algebra on Lattices.
Harry B. Hunt IIIDaniel J. RosenkrantzPeter A. BloniarzPublished in: SIAM J. Comput. (1987)
Keyphrases
- computational complexity
- boolean algebra
- distributive lattices
- special case
- algebraic expressions
- high computational complexity
- np complete
- computationally efficient
- low complexity
- np hard
- computational cost
- algebraic operations
- rate distortion
- query language
- genetic algorithm
- multiscale
- storage requirements
- data model
- bit rate
- relational algebra
- concept lattice
- search algorithm
- decision problems
- real time
- algebraic structures
- database systems