Learning a circuit by injecting values

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn 2006, Issue , 2006, Pages 584-593

  Angluin, Dana ^a   Aspnes, James ^a   Chen, Jiang ^a   Wu, Yinghua ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

Circuit; Gene regulatory network; Learning

Indexed keywords

BOOLEAN ALGEBRA; ELECTRIC WIRE; LEARNING SYSTEMS; MATHEMATICAL MODELS; POLYNOMIALS; SET THEORY;

ACYCLIC CIRCUITS; BOOLEAN CIRCUITS; GENE REGULATORY NETWORKS; TARGET CIRCUITS;

CIRCUIT THEORY;

EID: 33748104704     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1132516.1132600     Document Type: Conference Paper

References (15)

1. T. Akutsu, S. Kuhara, O. Maruyama, and S. Miyano. Identification of gene regulatory networks by strategic gene disruptions and gene overexpressions. In SODA '98: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 695-702, Philadelphia, PA, USA, 1998. Society for Industrial and Applied Mathematics.
2. D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147-164, 1992.
3. D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. J. ACM, 40:185-210, 1993.
4. D. Angluin and M. Kharitonov. When won't membership queries help? J. Comput. Syst. Sci., 50(2):336-355, 1995.
5. N. H. Bshouty. Exact learning boolean functions via the monotone theory. Inf. Comput., 123(1):146-153, 1995.
6. H. Fujiwara, Logic Testing and Design for Testability. MIT Press, 1986.
7. T. Ideker, V. Thorsson, and R. Karp. Discovery of regulatory interactions through perturbation: Inference and experimental design. In Pacific Symposium on Biocomputing 5, pages 302-313, 2000.
8. J. C. Jackson. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. Syst. Sci., 55(3):414-440, 1997.
9. J. C. Jackson, A. R. Klivans, and R. A. Servedio. Learnability beyond AC0. In STOC '02: Proceedings of the thirty-fourth annual ACM symposium on Theory of computing, pages 776-784, New York, NY, USA, 2002. ACM Press.
10. M. Kearns and L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata. J. ACM, 41(1):67-95, 1994.
11. M. Kharitonov. Cryptographic hardness of distribution-specific learning. In STOC '93: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing, pages 372-381, New York, NY, USA, 1993. ACM Press.
12. N. Linial, Y. Mansour, and N. Nisan. Constant depth circuits, Fourier transform, and learnability. Journal of the ACM, 40(3):607-620, 1993.
13. J. Naor and M. Naor. Small-bias probability spaces: Efficient constructions and applications. In ACM Symposium on Theory of Computing, pages 213-223, 1990.
14. G. Seroussi and N. H. Bshouty. Vector sets for exhaustive testings of logic circuits. In IEEE Transactions on Information Theory, volume 34, pages 513-522, May 1988.
15. L. G. Valiant. A theory of the learnable. Commun. ACM, 27:1134-1142, 1984.