Algebraic Structures with Hard Equivalence and Minimization Problems
From MaRDI portal
Publication:3765245
DOI10.1145/1634.1639zbMath0628.68039OpenAlexW2017460507MaRDI QIDQ3765245
Peter A. Bloniarz, Harry B. III Hunt, Daniel J. Rosenkrantz
Publication date: 1984
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1634.1639
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)
Related Items
A linear time equivalence test for read-twice DNF formulas, Computers and universal algebra: Some directions, The word and generator problems for lattices, Unnamed Item, Complexity of some language fragments of fuzzy logics, Solution of Rota's problem on the order of series-parallel networks, Minimization and equivalence in multi-valued logical models of regulatory networks, LOGICS AND ALGEBRAS FOR MULTIPLE PLAYERS, Partition semantics for relations, The finite embeddability property for residuated groupoids., On the complexity of dataflow analysis of logic programs, The complexity of equivalence for commutative rings, Nonfinitely based ai-semirings with finitely based semigroup reducts
