An arithmetic model of computation equivalent to threshold circuits
نویسندگان
چکیده
منابع مشابه
An Arithmetic Model of Computation Equivalent to Threshold Circuits
We define a new structured and general model of computation: circuits using arbitrary fan-in arithmetic gates over the characteristic-two finite fields (F,:,). These circuits have only one input and one output. We show how they correspond naturally to boolean computations with n inputs and n outputs. We show that if circuit sizes are polynomially related, then the arithmetic circuit depth and t...
متن کاملOn threshold circuits and polynomial computation
A Threshold Circuit consists of an acyclic digraph of unbounded fanin, where each node computes a threshold function or its negation. This paper investigates the computational power of Threshold Circuits. A surprising relationship is uncovered between Threshold Circuits and another class of unbounded fanin circuits which are denoted Finite Field ZP (n) Circuits, where each node computes either ...
متن کاملA Bounded Arithmetic Theory for Constant Depth Threshold Circuits
We deene an extension R 0 2 of the bounded arithmetic theory R 0 2 and show that the class of functions b 1-deenable in R 0 2 coincides with the computational complexity class TC 0 of functions computable by polynomial size, constant depth threshold circuits.
متن کاملFormalization of the Equivalent Transformation Computation Model
In the equivalent transformation (ET) computation model, a specification provides background knowledge in a problem domain and defines a set of queries of interest; a program is a set of prioritized transformation rules; and computation consists in successive reduction of queries using meaningpreserving transformation with respect to given background knowledge. This paper presents a formalizati...
متن کاملDepth-Efficient Threshold Circuits for Multiplication and Symmetric Function Computation
The multiplication operation and the computation of symmetric functions are fundamental problems in arithmetic and algebraic computation. We describe unit-weight threshold circuits to perform the multiplication of two n-bit integers, which have fan-in k, edge complexity O(n 2+1=d), and depth O(log d + log n= log k), for any xed integer d > 0. For a given fan-in, our constructions have considera...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1992
ISSN: 0304-3975
DOI: 10.1016/0304-3975(92)90335-d