"On the relative complexity of approximate counting problems."

Martin E. Dyer et al. (2000)

Details and statistics

DOI: 10.1007/3-540-44436-X_12

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics