# Functions Definable by Arithmetic Circuits

@inproceedings{PrattHartmann2009FunctionsDB, title={Functions Definable by Arithmetic Circuits}, author={Ian Pratt-Hartmann and Ivo D{\"u}ntsch}, booktitle={CiE}, year={2009} }

- Published in CiE 2009
DOI:10.1007/978-3-642-03073-4_42

An arithmetic circuit is a labelled, directed, acyclic graph specifying a cascade of arithmetic and logical operations to be performed on sets of non-negative integers. In this paper, we consider the definability of functions from tuples of sets of non-negative integers to sets of non-negative integers by means of arithmetic circuits. We prove two negative results: the first shows, roughly, that a function is not circuit-definable if it has an infinite range and sub-linear growth; the second… CONTINUE READING

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-8 OF 8 CITATIONS

## Complex Algebras of Arithmetic

VIEW 3 EXCERPTS

CITES BACKGROUND

## Circuit satisfiability and constraint satisfaction around Skolem Arithmetic

VIEW 1 EXCERPT

CITES BACKGROUND

## Constraint Satisfaction Problems around Skolem Arithmetic

VIEW 1 EXCERPT

CITES BACKGROUND

## Multiobjective Optimization and Language Equations

VIEW 1 EXCERPT

CITES BACKGROUND

## Infinite Oracle Queries in Type-2 Machines (Extended Abstract)

VIEW 2 EXCERPTS

CITES METHODS & RESULTS

## Real Hypercomputation with Infinite Oracle Queries

VIEW 1 EXCERPT

CITES METHODS

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 11 REFERENCES

## The Complexity of Membership Problems for Circuits Over Sets of Natural Numbers

VIEW 3 EXCERPTS

HIGHLY INFLUENTIAL

## The complexity of membership problems for circuits over sets of natural numbers

## Word Problems Requiring Exponential Time: Preliminary Report

VIEW 3 EXCERPTS