Referenced Items are not available for this document.
A common subproblem of DNF approximate counting and derandomizing RL is the discrepancy problem for combinatorial rectangles. We explicitly construct a poly(n)-size sample space that approximates the volume of any combinatorial rectangle in [n]n to within o(1) error. The construction extends the previous techniques for the analogous hitting set problem, most notably via discrepancy preserving reductions
Published in:
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium on
Date of Conference: 14-16 Oct 1996
- Page(s):
- 412 - 421
- Meeting Date :
- 14 Oct 1996-16 Oct 1996
- ISSN :
- 0272-5428
- Print ISBN:
- 0-8186-7594-2
- INSPEC Accession Number:
- 5444287
- Conference Location :
- Burlington, VT
- Digital Object Identifier :
- 10.1109/SFCS.1996.548500
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
