Tractabilitat de NP i altres classes de complexitat per famílies de circuits booleans
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...
| Autor: | |
|---|---|
| Tipo de documento: | relatório científico |
| Data de publicação: | 1987 |
| País: | España |
| Recursos: | Universitat Politècnica de Catalunya (UPC) |
| Repositório: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | catalão |
| OAI Identifier: | oai:upcommons.upc.edu:2117/189285 |
| Acesso em linha: | https://hdl.handle.net/2117/189285 |
| Access Level: | Acceso aberto |
| Palavra-chave: | Computational complexity Tècnica Karp Tècnica Lipton Circuits booleans Complexitat computacional Àrees temàtiques de la UPC::Informàtica |
| Resumo: | 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. |
|---|