The complexity of membership problems for circuits over sets of integers (Q861262): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.tcs.2006.08.017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1990151088 / rank | |||
Normal rank | |||
Revision as of 18:55, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The complexity of membership problems for circuits over sets of integers |
scientific article |
Statements
The complexity of membership problems for circuits over sets of integers (English)
0 references
9 January 2007
0 references
computational complexity
0 references
completeness
0 references
combinational circuits
0 references
arithmetic circuits
0 references
