A note on a theorem of Barrington, Straubing and Thérien (Q1351160)

From MaRDI portal
Revision as of 04:01, 5 March 2024 by Import240304020342 (talk | contribs) (Set profile property.)
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
    0 references
    27 February 1997
    0 references
    0 references
    Computational complexity
    0 references
    Lower bounds
    0 references
    Polynomials
    0 references