Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > POLYNOMIAL TIME MANY-ONE REDUCTIONS:
Reports tagged with polynomial time many-one reductions:
TR96-033 | 6th March 1996
Bernd Borchert, Desh Ranjan, Frank Stephan

On the Computational Complexity of some Classical Equivalence Relations on Boolean Functions

The paper analyzes in terms of polynomial time many-one reductions
the computational complexity of several natural equivalence
relations on Boolean functions which derive from replacing
variables by expressions. Most of these computational problems
turn out to be between co-NP and Sigma^p_2.

more >>>



ISSN 1433-8092 | Imprint