Skip to search formSkip to main contentSkip to account menu

Arithmetic circuit complexity

Known as: Arithmetic circuit, Arithmetic circuits complexity 
In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
In this paper we consider generalized versions of four well-studied problems in parameterized complexity and exact exponential… 
2012
2012
Arithmetic circuits arise in the context of weighted logic programming languages, such as Datalog with aggregation, or Dyna. A… 
2007
2007
In the fast growing communication field, requirements of low power designs are increasing to reduce the power losses and decrease… 
1997
1997
A programmable analog arithmetic circuit which can perform addition, subtraction, multiplication, and division at 7 bits of… 
1996
1996
Recently there have been a lot of progress in technologies for comparing two structurally similar large circuits [2, 14, 13… 
1996
1996
  • 1996
  • Corpus ID: 68744028
This volume investigates the introduction of Western music into the educational system of Japan and reveals the existence of… 
1993
1993
A systolic array of dedicated processing elements (PEs) is presented as the heart of a multi-model neural-network accelerator… 
1992
1992
A general design methodology for arithmetic operators in current mode multiple value logic is described. It is based on the… 
1985
1985
Modular integer exponentiation (given a, e, and m. compute a’ mod m) is a fundamental problem in algebraic complexity for which… 
1980
1980
It is well known that multiple valued logic can theoretically provide a greater logical packing density than binary logic. In…