Search for Author All Reviews
	Reingold, Nick     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending Date Reviewed     1 - 2 of 2 reviews       PP is closed under intersection Beigel R. (ed), Reingold N., Spielman D. Journal of Computer and System Sciences 50(2): 191-202, 1995.  Type: Article PP is the class of computational problems solvable by polynomial-time probabilistic algorithms. The authors report a significant advance in the understanding of closure properties of this complexity class. Their main result is that PP ...... Sep 1 1996     PP is closed under intersection Beigel R., Reingold N., Spielman D.  Theory of computing (Proceedings of the twenty-third annual ACM symposium, New Orleans, Louisiana, United States, May 5-8, 1991) 1-9, 1991.  Type: Proceedings PP (probabilistic polynomial time) was first studied in the 1970s, and basic properties of the class have been known since then (for instance, NP ⊆ PP, and PP is closed under complement). It had remained an open question wheth...... Oct 1 1991
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy