Subject
Computational Mathematics,Control and Optimization,Human-Computer Interaction
Reference8 articles.
1. T. J. Schaefer, ‘‘Complexity of satisfiability problems,’’ in Proc. 10th Annual ACM Symposium on Theory of Computing (STOC’78) (San Diego, CA, 1978), pp. 216–226. https://doi.org/10.1145/800133.804350
2. N. Creignou, S. Khanna, and M. Sudan, Complexity Classifications of Boolean Constraint Satisfaction Problems, SIAM Monographs on Discrete Mathematics and Applications (SIAM, Philadelphia, 2001). https://doi.org/10.1137/1.9780898718546
3. S. P. Gorshkov and A. V. Tarasov, Complexity of Solving Systems of Boolean Equations (Kurs, Moscow, 2017) [in Russian].
4. S. P. Gorshkov, ‘‘On the complexity of recognition of multiaffinity, bijunctivity, weak positivity, and weak negativity of Boolean functions,’’ Obz. Prom. Prikl. Mat. Ser.: Diskretn. Mat. 4 (2), 216–237 (1997).
5. S. N. Selezneva, ‘‘Multiaffine polynomials over a finite field,’’ Discrete Math. Appl. 31 (6), 421–430 (2021). https://doi.org/10.1515/dma-2021-0038
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献