About: Arithmetic circuit complexity

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Arithmetic circuit complexity Goto Sponge NotDistinct Permalink

An Entity of Type : dbo:Person, within Data Space : el.dbpedia.org associated with source document(s)

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 ?"

Attributes	Values
rdf:type	person
rdfs:label	Arithmetic circuit complexity (en)
rdfs:comment	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 ?" (en)
sameAs	Arithmetic circuit complexity
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Cite_journal dbt:Reflist
Subject	Circuit complexity
thumbnail	wiki-commons:Special:FilePath/ArithmeticCircuit.svg?width=300
foaf:depiction
gold:hypernym	Model
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Arithmetic_circuit_complexity?oldid=1028999006&ns=0
Wikipage page ID	21890324 (xsd:integer)
page length (characters) of wiki page	12600 (xsd:nonNegativeInteger)
Wikipage revision ID	1028999006 (xsd:integer)
Link from a Wikipage to another Wikipage	Boolean circuit Volker Strassen Bézout's identity Circuit complexity Directed acyclic graph Directed graph P versus NP problem Springer Science+Business Media Computational complexity of matrix multiplication Algorithmic complexity Partial derivative Permanent (mathematics) Determinant Field (mathematics) Tree (graph theory) Multilinear polynomial Matrix multiplication Polynomial Polynomial evaluation
has abstract	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 ?" (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Arithmetic_circuit_complexity
is Wikipage redirect of	Arithmetic circuit Arithmetic circuit SAT Arithmetic circuits complexity
is Link from a Wikipage to another Wikipage of	Geometric complexity theory Discrete cosine transform Computational complexity of matrix multiplication List of computability and complexity topics Arithmetic circuit Arithmetic circuit SAT Arithmetic circuits complexity
is foaf:primaryTopic of	http://en.wikipedia.org/wiki/Arithmetic_circuit_complexity

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software