Approximate counting in bounded arithmetic (Q5422312)

From MaRDI portal
Revision as of 16:58, 30 December 2024 by Import241228121245 (talk | contribs) (Normalize DOI.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article; zbMATH DE number 5201549
Language Label Description Also known as
English
Approximate counting in bounded arithmetic
scientific article; zbMATH DE number 5201549

    Statements

    title
    Approximate counting in bounded arithmetic (English)
    0 references
    author
    Emil Jeřábek
    0 references
    publication date
    17 October 2007
    0 references
    zbMATH Keywords
    approximate counting of sets
    0 references
    Boolean circuits
    0 references
    bounded arithmetic
    0 references
    dual weak pigeonhole principle
    0 references
    randomized complexity classes
    0 references

    Identifiers

    Mathematics Subject Classification ID
    03F30
    0 references
    03D15
    0 references
    68Q15
    0 references
    68W20
    0 references
    zbMATH DE Number
    5201549
    0 references
    OpenAlex ID
    W2125894854
    0 references
     
    Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5422312&oldid=39597103"
    Powered by MediaWiki