Approximate counting in bounded arithmetic (Q5422312): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 02:35, 9 February 2024
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
Approximate counting in bounded arithmetic (English)
0 references
17 October 2007
0 references
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