Articles In Academic Journals

Filter

Year	Title
1998	On the computational complexity of some classical equivalence relations on Boolean functions.  Theory of Computing Systems. 679-693.
1993	The circuit subfunction relations are $ sum P_2 $-complete.  Max-Planck-Institut für Informatik.

Conference Papers

Filter

Year	Title
1995	On the Computational Complexity of some Classical Equivalence Relations on...