DocumentCode :
2517546
Title :
Decomposing NC and AC
Author :
Wilson, Christopher B.
Author_Institution :
Dept. of Comput. & Inf. Sci., Oregon Univ., Eugene, OR, USA
fYear :
1989
fDate :
19-22 Jun 1989
Firstpage :
124
Lastpage :
131
Abstract :
It is shown that it is possible to decompose any level of NC into components involving lower levels. The results are extended to the class AC. The method presented results in a natural way to provide NC and AC with oracles
Keywords :
computational complexity; formal languages; parallel algorithms; AC; NC; decomposition; lower levels; oracles; Circuits; Computational modeling; Erbium; Hardware; Information science; Parallel algorithms; Phase change random access memory; Polynomials; Robustness;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Structure in Complexity Theory Conference, 1989. Proceedings., Fourth Annual
Conference_Location :
Eugene, OR
Print_ISBN :
0-8186-1958-9
Type :
conf
DOI :
10.1109/SCT.1989.41818
Filename :
41818
Link To Document :
بازگشت