On the complexity of statistical reasoning

Proceedings ISTCS 1995 - 3rd Israel Symposium on the Theory of Computing and Systems

Volumn , Issue , 1995, Pages 209-217

  Kilian, Joe ^a   Naor, Moni ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; HARDNESS;

APPROXIMATION PROBLEMS; BOOLEAN DOMAIN; COMPLETE SETS; HARDNESS OF APPROXIMATION; NP-HARDNESS RESULTS; POSITIVE CONSTANT; STATISTICAL REASONING; ZERO KNOWLEDGE;

STATISTICS;

EID: 0041634662     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISTCS.1995.377030     Document Type: Conference Paper

References (20)

1. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and intractability of approximation problems, Proc. 33'd IEEE Symp. on Foundation of Computer Science, 1992.
2. D. A. Barrington, Bounded-width polynomialsized branching programs recognize exactly those languages in NC', J. of Computer and Systems Sciences, vol 38, 1988, pp. 150-164.
3. M. Bellare, S. Goldwasser, C. Lund, A. Russell, Eficient probabilistic checkable proofs and applications to approximation, Proc. STOC, 1993, pp. 294-304.
4. E. Charniak, Bayesian networks without tears, AI Magazine, 1991, pp. 50-63.
5. C. Dwork, U. Feige, J. Kilian, M. Naor, S. Safra, Low communication %prover zeroknowledge proofs for NP Advances in Cryptology-Proceedings of Crypto '92, Lecture Notes in Computer Science 740, Springer Verlag, 1993, pp. 215-227.
6. G. F. Cooper, The computational complexity of probabilistic inference using Bayesian belief networks, Artificial Intelligence 42, 1990, pp. 393-405.
7. Dagum, P. and Luby, M. Approzimating probabilistic inference in Bayesian belief networks is NP-hard, Artificial Intelligence (March 1993) vo1. 60, no. 1, pp. 141-53.
8. R. Fagin, J. Halpern and N. Megiddo, A Logic for Reasoning A bout Probabilities, Information and Computation 87, 1990, pp. 78-128.
9. U. Feige, S. Goldwasser, L. Lovasz, M. Safra, M. Szegedy, Approximating Clique is Almost NPComplete Proc. 32nd IEEE Symp. on Foundation of Computer Science, 1991, pp. 2-12.
10. U. Feige and J. Kilian, Two Prover Protocols-Low Error at Aflordable Rates, Proceedings 26th Annual Symposium on the Theory of Computation, 1994.
11. 0. Goldreich, S. Micali, A. Wigderson, Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design, Proc. 27rd Symposium on Foundations of Computer Science, 1986, pp 174187.
12. J. Kilian. Founding Cryptography on Oblivious Transfer, Proceedings 20th Annual Symposium on the Theory of Computation, 1988.
13. J. Kilian, Use of Randomness in Algorithms and Protocols, MIT Press, 1990.
14. D. Koller, N. Megiddo, "Constructing small sample spaces satisfying given constraints", Proc. of 25th STOC, 1993, pp. 268-277.
15. N. Nilsson, Probabilistic Logic, Artificial Intelligence 28, 1986, pp. 71-87.
16. E. Neopolitan, Probabilistic reasoning in expert systems, Wiley, New York, 1990.
17. J. Pearle, Probabilistic reasoning in intelligent systems: networks of plausible inference, Morgan Kaufman, San Mateo, 1988.
18. D. Roth, "On the Hardness of Approximate Reasoning", manuscript.
19. L. G. Valiant, The complexity of computing the permanent. Theoretical Computer Science, 8: 189-201, 1979.
20. L. G. Valiant, The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8: 410-421, 1979.