D.K. Arrowsmith and R.A. Dow, "Additive cellular automata with external inputs." Complex Systems 9 (1995) 399--429.  Home/Search   Document Not in Database   Summary   Related Articles

....a Turing machine that generates Cn using O(log n) bits of memory. P is the class solvable by a deterministic Turing machine in polynomial time. It is easy to see that NC P, but like P NP this inclusion is believed, but not known, to be proper. From the definitions we have AC 0 ae ACC 0 [2] ae ACC 0 NC 1 AC 1 ACC 1 NC 2 Delta Delta Delta NC P The parity function is clearly in ACC 0 [2] and Ajtai and Furst et al. 1, 12] have shown that it is not in AC 0 . Razborov [30] has shown that majority is in NC 1 but not in ACC 0 [2] and Smolensky [33] ....

....in polynomial time. It is easy to see that NC P, but like P NP this inclusion is believed, but not known, to be proper. From the definitions we have AC 0 ae ACC 0 [2] ae ACC 0 NC 1 AC 1 ACC 1 NC 2 Delta Delta Delta NC P The parity function is clearly in ACC 0 [2], and Ajtai and Furst et al. 1, 12] have shown that it is not in AC 0 . Razborov [30] has shown that majority is in NC 1 but not in ACC 0 [2] and Smolensky [33] has shown that ACC 0 [p] and ACC 0 [q] are incomparable if p and q are distinct primes. Thus the first and second inclusions ....

[Article contains additional citation context not shown here]

D.K. Arrowsmith and R.A. Dow, "Additive cellular automata with external inputs." Complex Systems 9 (1995) 399--429.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC