L. M. Goldschlager and I. Parberry. On the construction of parallel computers form various bases of Boolean functions. Theoretical Computer Science, 43:43--58, 1986.  Home/Search   Document Not in Database   Summary   Related Articles

.... Gill, Hertrampf [5] For k 2, define Mod k P to be the class of all languages L such that there exists M such that, for all x, x 2 L ( #M (x) 6j 0 mod k: The class Mod 2 P is also called PhiP ( Parity P ) This class was defined by Papadimitriou Zachos [20] and by Goldschlager Parberry [10] (see [4] for details) The following two classes will also be of interest to us: Definition 2.4 ffl (Allender [1] For any language L, L 2 FewP if and only if there exist a CM M and a polynomial p such that for all x 2 Sigma , #M (x) p(jxj) and x 2 L ( #M (x) 0: ffl (Cai Hemachandra ....

L. M. Goldschlager and I. Parberry. On the construction of parallel computers form various bases of Boolean functions. Theoretical Computer Science, 43:43--58, 1986.

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