Title :
Unambiguity of circuits
Author :
Lange, Klaus-Jörn
Author_Institution :
Inst. fuer Inf., Tech. Univ., Munchen, West Germany
Abstract :
The concept of unambiguity of circuits is considered. Several classes of unambiguous circuit families within the NC-hierarchy are introduced and related to unambiguous automata and to PRAMs with exclusive write-access. In particular, it is shown that CREW-TIME (log n)=UnambAC
Keywords :
automata theory; circuit layout CAD; computational complexity; NC-hierarchy; PRAMs; exclusive write-access; unambiguous automata; unambiguous circuit families; Automata; Circuits; Complexity theory; Cyclic redundancy check; Phase change random access memory; Polynomials; Turing machines;
Conference_Titel :
Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual
Conference_Location :
Barcelona
Print_ISBN :
0-8186-6072-4
DOI :
10.1109/SCT.1990.113962
