Arithmetic circuit complexity
In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as inputs either variables or numbers, and is allowed to either add or multiply two expressions it has already computed. Arithmetic circuits provide a formal way to understand the complexity of computing polynomials. The basic type of question in this line of research is "what is the most efficient way to compute a given polynomial ?"
Link from a Wikipage to another Wikipage
primaryTopic
Arithmetic circuit complexity
In computational complexity theory, arithmetic circuits are the standard model for computing polynomials. Informally, an arithmetic circuit takes as inputs either variables or numbers, and is allowed to either add or multiply two expressions it has already computed. Arithmetic circuits provide a formal way to understand the complexity of computing polynomials. The basic type of question in this line of research is "what is the most efficient way to compute a given polynomial ?"
has abstract
In computational complexity th ...... compute a given polynomial ?"
@en
Wikipage page ID
21,890,324
page length (characters) of wiki page
Wikipage revision ID
1,024,983,792
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
subject
hypernym
type
comment
In computational complexity th ...... compute a given polynomial ?"
@en
label
Arithmetic circuit complexity
@en