On the premaximal Boolean bases

被引：0

|

作者：

Cherukhin, D. Yu.

机构：

来源：

Discrete Mathematics and Applications | / 9卷 / 03期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：295 / 342

相关论文

共 50 条

[31] ON WEAK BASES FOR BOOLEAN RELATIONAL CLONES AND REDUCTIONS FOR COMPUTATIONAL PROBLEMS
Behrisch, Mike
JOURNAL OF APPLIED LOGICS-IFCOLOG JOURNAL OF LOGICS AND THEIR APPLICATIONS, 2023, 10 (06):
[32] A FRAMEWORK FOR HANDLING LOGICAL INCONSISTENCIES IN THE FUSION OF BOOLEAN KNOWLEDGE BASES
Gregoire, Eric
Zhang, Du
INTERNATIONAL JOURNAL OF SEMANTIC COMPUTING, 2011, 5 (03) : 323 - 334
[33] Groebner bases computation in Boolean rings is P-SPACE
Lamar University, United States
World Acad. Sci. Eng. Technol., 2009, (960-965):
[34] ON THE CONSTRUCTION OF PARALLEL COMPUTERS FROM VARIOUS BASES OF BOOLEAN FUNCTIONS
GOLDSCHLAGER, LM
PARBERRY, I
THEORETICAL COMPUTER SCIENCE, 1986, 43 (01) : 43 - 58
[35] Uniform Approximation of Continuous Functions by Probability Functions of Boolean Bases
Yashunskii, A. D.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2007, 62 (02) : 78 - 84
[36] A pommaret division algorithm for computing grobner bases in boolean rings
Gerdt, Vladimir P.
Zinin, Mikhail V.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, ISSAC, 2008,
[37] Role of involutive criteria in computing Boolean Gröbner bases
V. P. Gerdt
M. V. Zinin
Programming and Computer Software, 2009, 35 : 90 - 97
[38] On Weak Bases for Boolean Relational Clones and Reductions for Computational Problems
Behrisch, Mike
Journal of Applied Logics, 2023, 10 (06): : 1059 - 1103
[39] On the complexity of realization of the linear function by formulas over finite Boolean bases
2000, VSP BV, Zeist, Netherlands (10):
[40] Realization of Boolean functions by formulas in continuous bases containing a continuum of constants
Ya. V. Vegner
S. B. Gashkov
Mathematical Notes, 2012, 92 : 166 - 175

← 1 2 3 4 5 →