A note on a theorem of Barrington, Straubing and Thérien (Q1351160): Difference between revisions
From MaRDI portal
Latest revision as of 11:09, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on a theorem of Barrington, Straubing and Thérien |
scientific article |
Statements
A note on a theorem of Barrington, Straubing and Thérien (English)
0 references
27 February 1997
0 references
Computational complexity
0 references
Lower bounds
0 references
Polynomials
0 references
0 references