Funder
Russian Foundation for Basic Research
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference8 articles.
1. Boros, E., Elbassioni, K., Gurvich, V., Makino, K.: Generating vertices of polyhedra and related problems of monotone generation. In: Proceedings of the Centre de Recherches Mathématiques at the Université de Montréal, special issue on Polyhedral Computation (CRM Proceedings and Lecture Notes), vol. 49, pp 15–43 (2009)
2. Büning, H.K., Lettmann, T.: Propositional Logic: Deduction and Algorithms, vol. 48. Cambridge University Press, Cambridge (1999)
3. Elbassioni, K., Makino, K., Rauf, I.: On the readability of monotone boolean formulae. J. Comb. Optim. 22(3), 293–304 (2011)
4. Gilmer, J., Kouckỳ, M., Saks, M.E.: A new approach to the sensitivity conjecture. In: Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, pp. 247–254. ACM (2015)
5. Golumbic, M.C., Gurvich, V.: Read-Once Functions. Boolean Functions: Theory, Algorithms and Applications (2009)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献