"On the argument complexity of multiply transitive Boolean functions."

Ulrich Hedtstück (1983)

Details and statistics

DOI: 10.1007/3-540-13331-3_54

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-19

a service of  Schloss Dagstuhl - Leibniz Center for Informatics