Selected Publications

Articles In Academic Journals

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

Conference Papers

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