Tractabilitat de NP i altres classes de complexitat per famílies de circuits booleans

Abstract

We search for nonuniform analogs of the complexity class N P ¿ coN P. Following mainly the work of Karp and Lipton on these classes, 1) We define two types of polynomial time reducibility, study some of their basic properties and separate them; 2) We show that the corresponding reduction classes of the sparse sets give two versions of the desired nonuniform class; 3) We propose a model of circuits for one of the classes obtained.