Rolf Clauberg
IBM J. Res. Dev
We present polynomial-time algorithms for the uniform word problem and for the generator problem for lattices. The algorithms are derived from novel, prooftheoretic approaches. We prove that both problems are log-space complete for P, but can be solved in deterministic logarithmic space in the case of free lattices. We also show that the more general problem of testing whether a given open sentence is true in all lattices is co-NP complete. © 1988.
Rolf Clauberg
IBM J. Res. Dev
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev
Fan Jing Meng, Ying Huang, et al.
ICEBE 2007
Marshall W. Bern, Howard J. Karloff, et al.
Theoretical Computer Science