On the use of Boolean methods for the computation of the stability number

被引：0

作者：

DMA, Ecl. Polytech. Federale de Lausanne, 1015 Lausanne, Switzerland ^{[1
]}

机构：

来源：

Discrete Appl Math | / 1-3卷 / 183-203期

关键词：

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

共 50 条

[21] Parallel computation of boolean Grobner bases
Sato, Y
Suzuki, A
PROCEEDINGS OF THE FOURTH ASIAN TECHNOLOGY CONFERENCE IN MATHEMATICS, 1999, : 265 - 274
[22] On the Computation of Comprehensive Boolean Grobner Bases
Inoue, Shutaro
COMPUTER ALGEBRA IN SCIENTIFIC COMPUTING, PROCEEDINGS, 2009, 5743 : 130 - 141
[23] Fast computation of symmetries in Boolean functions
Mishchenko, A
IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2003, 22 (11) : 1588 - 1593
[24] The complexity of Boolean matrix root computation
Kutz, M
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2003, 2697 : 212 - 221
[25] ON THE PLANAR MONOTONE COMPUTATION OF BOOLEAN FUNCTIONS
BEYNON, M
BUCKLE, J
THEORETICAL COMPUTER SCIENCE, 1987, 53 (2-3) : 267 - 279
[26] NORMAL ALGORITHMS FOR COMPUTATION OF BOOLEAN FUNCTIONS
MARKOV, AA
DOKLADY AKADEMII NAUK SSSR, 1964, 157 (02): : 262 - &
[27] The complexity of Boolean matrix root computation
Kutz, M
THEORETICAL COMPUTER SCIENCE, 2004, 325 (03) : 373 - 390
[28] Number of clique Boolean functions
Int Christian Univ, Mitaka-shi, Japan
IEICE Trans Fund Electron Commun Comput Sci, 8 (1502-1507):
[29] The number of clique Boolean functions
Pogosyan, G
Miyakawa, M
Nozaki, A
Rosenberg, IG
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1997, E80A (08) : 1502 - 1507
[30] On the Number of Roots of Boolean Polynomials
Leont'ev, V. K.
Gordeev, E. N.
COMPUTATIONAL MATHEMATICS AND MATHEMATICAL PHYSICS, 2018, 58 (07) : 1188 - 1197

← 1 2 3 4 5 →