Hardness of approximate two-level logic minimization and PAC learning with membership queries-Reference-Cited by-同舟云学术

Hardness of approximate two-level logic minimization and PAC learning with membership queries

Published:2009-01 Issue:1 Volume:75 Page:13-26
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Feldman Vitaly

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference42 articles.

1. Automatic subspace clustering of high dimensional data;Agrawal;Data Min. Knowl. Discov.,2005

2. The complexity of properly learning simple classes;Alekhnovich;J. Comput. System Sci.,2008

3. E. Allender, L. Hellerstein, P. McCabe, T. Pitassi, M. Saks, Minimizing DNF formulas and AC0 circuits given a truth table, in: Proceedings of IEEE Conference on Computational Complexity, 2006, pp. 237–251

4. E. Allender, L. Hellerstein, T. Pitassi, M. Saks, On the complexity of finding minimal representations of Boolean functions, unpublished, 2004

5. When won't membership queries help?;Angluin;J. Comput. System Sci.,1995

Cited by 21 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. SAT Reduces to the Minimum Circuit Size Problem with a Random Oracle;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06

2. Learning Horn envelopes via queries from language models;International Journal of Approximate Reasoning;2023-09

3. NP-Hardness of Approximating Meta-Complexity: A Cryptographic Approach;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

4. Adaptive Sparse Representation of Continuous Input for Tsetlin Machines Based on Stochastic Searching on the Line;Electronics;2021-08-30

5. Hardness of learning DNFs using halfspaces;Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing;2021-06-15