The complexity of membership problems for circuits over sets of integers (Q861262)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5083785
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The complexity of membership problems for circuits over sets of integers |
scientific article; zbMATH DE number 5083785 |
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
0.995413899421692
0 references
0.9191047549247742
0 references
0.9016088247299194
0 references
0.8504298329353333
0 references
