Subject
Computational Theory and Mathematics,Computational Mathematics,Control and Optimization
Reference20 articles.
1. A linear time algorithm for recognizing regular Boolean functions;Makino,1999
2. Complexity theoretic hardness results for query learning;Aizenstein;Comput. Complexity,1998
3. Computers and Intractability;Garey,1979
4. Polynomial-time algorithm for regular set-covering and threshold synthesis;Peled;Discrete Appl. Math.,1985
5. Dualization of regular Boolean functions;Crama;Discrete Appl. Math.,1987
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献