"Efficient Algorithms for Computing Modulo Permutation Theories."

Jürgen Avenhaus (2004)

Details and statistics

DOI: 10.1007/978-3-540-25984-8_31

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-21

a service of  Schloss Dagstuhl - Leibniz Center for Informatics