Number of the records: 1

Approximate counting by hashing in bounded arithmetic

SYSNO	0326451
Title	Approximate counting by hashing in bounded arithmetic
Title	Aproximativní počítání pomocí hashování v omezené aritmetice
Author(s)	Jeřábek, Emil (MU-W)_{RID, SAI, ORCID}
Source Title	Journal of Symbolic Logic. Roč. 74, č. 3 (2009), s. 829-860. - : Cambridge University Press
Document Type	Článek v odborném periodiku
Grant	IAA1019401 GA AV ČR - Academy of Sciences of the Czech Republic (AV ČR)
CEZ	AV0Z10190503 - MU-W (2005-2011)
Language	eng
Country	US
Keywords	bounded arithmetic * approximate counting * universal hashing
Permanent Link	http://hdl.handle.net/11104/0173553

	File	Download	Size	Commentary	Version	Access
	Jerabek1.pdf	1	11.3 MB		Publisher’s postprint	require

Number of the records: 1