Result 1 to 20 of 168 total
The Boolean formula value problem as formal language. (English)
Bordihn, Henning (ed.) et al., Languages alive. Essays dedicated to Jürgen Dassow on the occasion of his 65th birthday. Berlin: Springer (ISBN 978-3-642-31643-2/pbk). Lecture Notes in Computer Science 7300, 138-144 (2012).
1
Solving Trivium-based Boolean equations using the method of syllogisms. (English)
Fundam. Inform. 114, No. 3-4, 359-373 (2012).
2
Language equations with complementation: expressive power. (English)
Theor. Comput. Sci. 416, 71-86 (2012).
3
On construction of efficient algorithms for solving systems of polynomial Boolean equations by testing a part of variables. (English)
Discrete Math. Appl. 21, No. 3, 381-395 (2011); translation from Diskretn. Mat. 23, No. 3 (2011).
4
Using variable-entered Karnaugh maps to produce compact parametric general solutions of Boolean equations. (English)
Int. J. Comput. Math. 88, No. 15, 3136-3149 (2011).
5
The polyhedral Lagrange principle. (English)
Sib. Math. J. 52, No. 3, 484-486 (2011); translation from Sib. Mat. Zh. 52, No. 3, 615-618 (2011).
6
Expressive power of $\text{LL}(k)$ Boolean grammars. (English)
Theor. Comput. Sci. 412, No. 39, 5132-5155 (2011).
7
Sparse Boolean equations and circuit lattices. (English)
Des. Codes Cryptography 59, No. 1-3, 349-364 (2011).
8
Boolean functions. Theory, algorithms, and applications. (English)
Encyclopedia of Mathematics and its Applications 142. Cambridge: Cambridge University Press (ISBN 978-0-521-84751-3/hbk; 978-1-139-06424-8/ebook). xxi, 687~p. \sterling~95.00, \$~150.00/hbk; \$~120.00/ebook (2011).
9
Comments on a numerical method for solving Boolean equations. (English)
Inf. Sci. 181, No. 3, 547-551 (2011).
10
A simple P-complete problem and its language-theoretic representations. (English)
Theor. Comput. Sci. 412, No. 1-2, 68-82 (2011).
11
Analysis and control of Boolean networks. A semi-tensor product approach. (English)
Communications and Control Engineering. New York, NY: Springer (ISBN 978-0-85729-096-0/hbk; 978-0-85729-097-7/ebook). xvi, 470~p. EUR~119.95/net; SFR~172.00; \sterling~108.00; \$~159.00 (2011).
12
The use of associative information processing for constructing algorithms for solving systems of Boolean equations. (Russian ;English)
Zh. Vychisl. Mat. Mat. Fiz. 50, No. 11, 2028-2044 (2010); translation in Comput. Math., Math. Phys. 50, No. 11, 1925-1940 (2010).
13
Level structure of Zhegalkin polynomials, properties of test sets, and an annihilator search algorithm. (Russian ;English)
Zh. Vychisl. Mat. Mat. Fiz. 50, No. 7, 1334-1340 (2010); translation in Comput. Math., Math. Phys. 50, No. 7, 1267-1273 (2010).
14
Boolean grammars and gsm mappings. (English)
Int. J. Found. Comput. Sci. 21, No. 5, 799-815 (2010).
15
Decision problems for language equations. (English)
J. Comput. Syst. Sci. 76, No. 3-4, 251-266 (2010).
16
Solution of systems of Boolean equations via the integer domain. (English)
Inf. Sci. 180, No. 2, 288-300 (2010).
17
A note on “Resolution of fuzzy relation equations (I) based on Boolean-type implications”. (English)
Comput. Math. Appl. 57, No. 8, 1365-1368 (2009).
18
Numerical solvers and cryptanalysis. (English)
J. Math. Cryptol. 3, No. 3, 249-263 (2009).
19
Challenges in constraint-based analysis of hybrid systems. (English)
Oddi, Angelo (ed.) et al., Recent advances in constraints. 13th annual ERCIM international workshop on constraint solving and constraint logic programming, CSCLP 2008, Rome, Italy, June 18‒20, 2008. Revised selected papers. Berlin: Springer (ISBN 978-3-642-03250-9/pbk). Lecture Notes in Computer Science 5655. Lecture Notes in Artificial Intelligence, 51-65 (2009).
20
Result 1 to 20 of 168 total
Start
Contact
Print
General Help
