Number of the records: 1
Approximate counting by hashing in bounded arithmetic
- 1.0326451 - MÚ 2010 RIV US eng J - Journal Article
Jeřábek, Emil
Approximate counting by hashing in bounded arithmetic.
[Aproximativní počítání pomocí hashování v omezené aritmetice.]
Journal of Symbolic Logic. Roč. 74, č. 3 (2009), s. 829-860. ISSN 0022-4812. E-ISSN 1943-5886
R&D Projects: GA AV ČR IAA1019401
Institutional research plan: CEZ:AV0Z10190503
Keywords : bounded arithmetic * approximate counting * universal hashing
Subject RIV: BA - General Mathematics
Impact factor: 0.631, year: 2009
Permanent Link: http://hdl.handle.net/11104/0173553File Download Size Commentary Version Access Jerabek1.pdf 1 11.3 MB Publisher’s postprint require
Number of the records: 1