On the computational complexity of algebra on lattices

Authors:
H. B. Hunt, III;D. J. Rosenkrantz;P. A. Bloniarz
Affiliations:
State Univ. of New York at Albany, Albany;State Univ. of New York at Albany, Albany;State Univ. of New York at Albany, Albany
Venue:
SIAM Journal on Computing
Year:
1987

Citing 0
Cited 5

Resolution-based decision procedures for the universal theory of some classes of distributive lattices with operators

Journal of Symbolic Computation
On unification for bounded distributive lattices

ACM Transactions on Computational Logic (TOCL)
Generic expression hardness results for primitive positive formula comparison

ICALP'11 Proceedings of the 38th international conference on Automata, languages and programming - Volume Part II
Generic expression hardness results for primitive positive formula comparison

Information and Computation
Polynomial space hardness without disjunction property

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract