Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Bergman, Cliff - Department of Mathematics, Iowa State University
COMPLEXITY OF SOME PROBLEMS CONCERNING VARIETIES AND QUASI-VARIETIES OF ALGEBRAS
CATEGORICAL EQUIVALENCE OF MODES CLIFFORD BERGMAN AND JOEL BERMAN
CATEGORICAL EQUIVALENCE OF ALGEBRAS WITH A MAJORITY TERM
ON THE RELATIONSHIP OF AP, RS AND CEP IN CONGRUENCE MODULAR VARIETIES. II
CONVERGENCE OF CYCLIC RANDOM WALKS WITH AN APPLICATION TO CRYPTANALYSIS
Unitary Embedding for Data Hiding with the SVD Clifford Bergman and Jennifer Davidson
COMPUTATIONAL COMPLEXITY OF TERM-EQUIVALENCE
MORITA EQUIVALENCE OF ALMOST-PRIMAL CLONES Clifford Bergman and Joel Berman
COMPUTATIONAL COMPLEXITY OF SOME PROBLEMS INVOLVING
Math. Struct. in Comp. Science (1995), vol. 11, pp. 1000 Copyright c Cambridge University Press Algorithms for categorical equivalence
THE AMALGAMATION CLASS OF A DISCRIMINATOR VARIETY IS FINITELY AXIOMATIZABLE
COMPUTATIONAL COMPLEXITY OF GENERATORS AND NONGENERATORS IN ALGEBRA
SUBQUASIVARIETIES OF REGULARIZED VARIETIES Clifford Bergman and Anna Romanowska
