Complex polynomials and circuit lower bounds for modular counting (Q1346614): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complex polynomials and circuit lower bounds for modular counting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Non-uniform automata over groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: PP is closed under intersection / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 12:39, 23 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Complex polynomials and circuit lower bounds for modular counting |
scientific article |
Statements
Complex polynomials and circuit lower bounds for modular counting (English)
0 references
6 April 1995
0 references
threshold circuits
0 references
modular counting
0 references
MAJORITY gates
0 references