Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Circuits over sets of natural numbers

Circuits over natural numbers are a mathematical model used in studying computational complexity theory. They are a special case of circuits. The… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
We study the computational complexity of emptiness problems for circuits over sets of natural numbers with the operations union… Expand
  • table 1
2010
2010
We investigate the complexity of satisfiability problems for {@?,@?,^-,+,x}-circuits computing sets of natural numbers. These… Expand
2008
2008
We investigate the complexity of equivalence problems for {∪,∩,−,+,×}-circuits computing sets of natural numbers. These problems… Expand
  • table 1
Highly Cited
2007
Highly Cited
2007
Abstract.The problem of testing membership in the subset of the natural numbers produced at the output gate of a {$$\bigcup… Expand
  • table 10.1
2007
2007
We investigate the complexity of satisfiability problems for {∪, ∩, -, +, ×}-circuits computing sets of natural numbers. These… Expand
2007
2007
We investigate the complexity of equivalence problems for {∪ ∩ -,+,×}-circuits computing sets of natural numbers. These problems… Expand
Highly Cited
2007
Highly Cited
2007
Invited Papers.- The Multicore Revolution.- Streaming Algorithms for Selection and Approximate Sorting.- Adventures in… Expand
2007
2007
Proving Church's Thesis.- The Limits of Quantum Computers.- Marrying Words and Trees.- TPTP, TSTP, CASC, etc..- Abstract Modeling… Expand
2003
2003
The problem of testing membership in the subset of the natural numbers produced at the output gate of a… Expand