nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A polyhedral approach for a constrained quadratic 0–1 problem
|
Faye, Alain |
|
2005 |
149 |
1-3 |
p. 87-100 14 p. |
artikel |
2 |
Author index to volume 149
|
|
|
2005 |
149 |
1-3 |
p. 219- 1 p. |
artikel |
3 |
Characterizations of closed classes of Boolean functions in terms of forbidden subfunctions and Post classes
|
Zverovich, Igor’ E. |
|
2005 |
149 |
1-3 |
p. 200-218 19 p. |
artikel |
4 |
Computing the minimum DNF representation of Boolean functions defined by intervals
|
Schieber, Baruch |
|
2005 |
149 |
1-3 |
p. 154-173 20 p. |
artikel |
5 |
Contents
|
|
|
2005 |
149 |
1-3 |
p. viii-ix nvt p. |
artikel |
6 |
Editorial Board
|
|
|
2005 |
149 |
1-3 |
p. v-vii nvt p. |
artikel |
7 |
Factoring Boolean functions using graph partitioning
|
Mintz, Aviad |
|
2005 |
149 |
1-3 |
p. 131-153 23 p. |
artikel |
8 |
Guide for authors
|
|
|
2005 |
149 |
1-3 |
p. I-IV nvt p. |
artikel |
9 |
Known and new classes of generalized Horn formulae with polynomial recognition and SAT testing
|
Čepek, Ondřej |
|
2005 |
149 |
1-3 |
p. 14-52 39 p. |
artikel |
10 |
k-th order symmetric SAC boolean functions and bisecting binomial coefficients
|
Cusick, T.W. |
|
2005 |
149 |
1-3 |
p. 73-86 14 p. |
artikel |
11 |
Linear symmetries of Boolean functions
|
Xiao, Wenjun |
|
2005 |
149 |
1-3 |
p. 192-199 8 p. |
artikel |
12 |
On the computational complexity of defining sets
|
Hatami, Hamed |
|
2005 |
149 |
1-3 |
p. 101-110 10 p. |
artikel |
13 |
On the size of maximum renamable Horn sub-CNF
|
Kučera, Petr |
|
2005 |
149 |
1-3 |
p. 126-130 5 p. |
artikel |
14 |
Real royal road functions—where crossover provably is essential
|
Jansen, Thomas |
|
2005 |
149 |
1-3 |
p. 111-125 15 p. |
artikel |
15 |
Supermodular functions and the complexity of MAX CSP
|
Cohen, David |
|
2005 |
149 |
1-3 |
p. 53-72 20 p. |
artikel |
16 |
The complexity of modular decomposition of Boolean functions
|
Bioch, Jan C. |
|
2005 |
149 |
1-3 |
p. 1-13 13 p. |
artikel |
17 |
The many benefits of putting stack filters into disjunctive or conjunctive normal form
|
Wild, Marcel |
|
2005 |
149 |
1-3 |
p. 174-191 18 p. |
artikel |