Functions Definable by Arithmetic Circuits

@inproceedings{PrattHartmann2009FunctionsDB,
  title={Functions Definable by Arithmetic Circuits},
  author={I. Pratt-Hartmann and I. D{\"u}ntsch},
  booktitle={CiE},
  year={2009}
}
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… Expand
Complex Algebras of Arithmetic
Balance problems for integer circuits
  • Titus Dose
  • Mathematics, Computer Science
  • Theor. Comput. Sci.
  • 2019
Balance Problems for Integer Circuits
  • Titus Dose
  • Computer Science, Mathematics
  • Electron. Colloquium Comput. Complex.
  • 2018
Emptiness problems for integer circuits
Real Hypercomputation with Infinite Oracle Queries
Circuit satisfiability and constraint satisfaction around Skolem Arithmetic
Infinite Oracle Queries in Type-2 Machines (Extended Abstract)
...
1
2
...

References

SHOWING 1-10 OF 14 REFERENCES
Equivalence Problems for Circuits over Sets of Natural Numbers
The Bounded Arithmetic Hierarchy
  • K. Harrow
  • Computer Science, Mathematics
  • Inf. Control.
  • 1978
Integer circuit evaluation is PSPACE-complete
  • Ke Yang
  • Mathematics, Computer Science
  • Proceedings 15th Annual IEEE Conference on Computational Complexity
  • 2000
Satisfiability of algebraic circuits over sets of natural numbers
CLASSES OF PREDICTABLY COMPUTABLE FUNCTIONS
Complexity of solutions of equations over sets of natural numbers
The Complexity of Membership Problems for Circuits over Sets of Integers
On the Recognition of Primes by Automata
Word problems requiring exponential time(Preliminary Report)
...
1
2
...