• DocumentCode
    2722229
  • Title

    Unambiguity of circuits

  • Author

    Lange, Klaus-Jörn

  • Author_Institution
    Inst. fuer Inf., Tech. Univ., Munchen, West Germany
  • fYear
    1990
  • fDate
    8-11 July 1990
  • Firstpage
    130
  • Lastpage
    137
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Structure in Complexity Theory Conference, 1990, Proceedings., Fifth Annual
  • Conference_Location
    Barcelona
  • Print_ISBN
    0-8186-6072-4
  • Type

    conf

  • DOI
    10.1109/SCT.1990.113962
  • Filename
    113962
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2722229