Approximate inclusion-exclusion

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Approximate inclusion-exclusion

Full text

Pdf (804 KB)

Source

Annual ACM Symposium on Theory of Computing archive
Proceedings of the twenty-second annual ACM symposium on Theory of computing table of contents

Baltimore, Maryland, United States

Pages: 260 - 270

Year of Publication: 1990

ISBN:0-89791-361-2

Authors

N. Linial	IBM-Almaden, Stanford University and Hebrew University
N. Nisan	Department of Computer Science, Hebrew University

Sponsor

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 6, Downloads (12 Months): 39, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/100216.100250 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	AH88	N. Alon and J. Hastad. 1988. Private communication.
	AW85	M. Ajtai and A. Wigderson. Deterministic simulation of probabilistic constant depth circuits". In 26 th Annual Symposium on Foundations of Computer Science, Portland, Oregon, pages 11-19, 1985.
	Che66	E. W. Cheney. Approximation Theory. McGraw-Hill Book Co., 1966.
	NW88	N. Nisan and A. Wigderson. Hardness vs. randomness. In 29 th Annual Symposium on Foundations of Computer Science, White Plains, New York, pages 2- 12, October 1988.
	Riv69	Theodore J. Rivlin. An Introduction to the Approximation of Functions. Blaisdell Publishing Company, 1969.
	Rys63	H. J. Ryser. Combinatorial mathematics. The Mathematical Association of America, 1963.
	Val79	L.G. Valiant. The complexity of computing the permanent. Theor. Comp. Sci., 8:189-201, 1979.

CITED BY 6

	Guy Even , Oded Goldreich , Michael Luby , Noam Nisan , Boban Veličkovic, Approximations of general independent distributions, Proceedings of the twenty-fourth annual ACM symposium on Theory of computing, p.10-16, May 04-06, 1992, Victoria, British Columbia, Canada
	Michael Luby , Boban Veličkovic, On deterministic approximation of DNF, Proceedings of the twenty-third annual ACM symposium on Theory of computing, p.430-438, May 05-08, 1991, New Orleans, Louisiana, United States
	Nathan Linial , Yishay Mansour , Noam Nisan, Constant depth circuits, Fourier transform, and learnability, Journal of the ACM (JACM), v.40 n.3, p.607-620, July 1993
	Meera Sitharam, Pseudorandom generators and learning algorithms for AC, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.478-486, May 23-25, 1994, Montreal, Quebec, Canada
	Szymon Jaroszewicz , Dan A. Simovici , Ivo Rosenberg, Measures on Boolean polynomials and their applications in data mining, Discrete Applied Mathematics, v.144 n.1-2, p.123-139, 30 November 2004
	Akira Maruoka , Mike Paterson , Hirotaka Koizumi, Consistency of Natural Relations on Sets, Combinatorics, Probability and Computing, v.7 n.3, p.281-293, September 1998