On the argument complexity of multiply transitive Boolean functions

Ulrich Hedtstück. On the argument complexity of multiply transitive Boolean functions. In Egon Börger, Gisbert Hasenjaeger, Dieter Rödding, editors, Logic and Machines: Decision Problems and Complexity, Proceedings of the Symposium Rekursive Kombinatorik held from May 23-28, 1983 at the Institut für Mathematische Logik und Grundlagenforschung der Universität Münster/Westfahlen. Volume 171 of Lecture Notes in Computer Science, pages 390-396, Springer, 1983.

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.