no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
1 |
Approximating a generalization of MAX 2SAT and MIN 2SAT
|
Hochbaum, Dorit S. |
|
2000 |
107 |
1-3 |
p. 41-59 19 p. |
article |
2 |
Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT
|
van Maaren, Hans |
|
2000 |
107 |
1-3 |
p. 225-239 15 p. |
article |
3 |
Disjunctive and conjunctive normal forms of pseudo-Boolean functions
|
Foldes, Stephan |
|
2000 |
107 |
1-3 |
p. 1-26 26 p. |
article |
4 |
General lower bounds on the query complexity within the exact learning model
|
Klasner, Norbert |
|
2000 |
107 |
1-3 |
p. 61-81 21 p. |
article |
5 |
Hardness of identifying the minimum ordered binary decision diagram
|
Takenaga, Yasuhiko |
|
2000 |
107 |
1-3 |
p. 191-201 11 p. |
article |
6 |
Index
|
|
|
2000 |
107 |
1-3 |
p. 261- 1 p. |
article |
7 |
Investigations on autark assignments
|
Kullmann, Oliver |
|
2000 |
107 |
1-3 |
p. 99-137 39 p. |
article |
8 |
On subclasses of minimal unsatisfiable formulas
|
Büning, Hans Kleine |
|
2000 |
107 |
1-3 |
p. 83-98 16 p. |
article |
9 |
On the relations between SAT and CSP enumerative algorithms
|
Génisson, Richard |
|
2000 |
107 |
1-3 |
p. 27-40 14 p. |
article |
10 |
Polyhedral structure of submodular and posi-modular systems
|
Nagamochi, Hiroshi |
|
2000 |
107 |
1-3 |
p. 165-189 25 p. |
article |
11 |
Reflectiveness and compression of threshold transformations
|
Ueda, Takao |
|
2000 |
107 |
1-3 |
p. 215-224 10 p. |
article |
12 |
Solving satisfiability problems using elliptic approximations – effective branching rules
|
Warners, Joost P. |
|
2000 |
107 |
1-3 |
p. 241-259 19 p. |
article |
13 |
The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making
|
Marichal, Jean-Luc |
|
2000 |
107 |
1-3 |
p. 139-164 26 p. |
article |
14 |
Trading properties and Alexandrov kernels for Boolean functions
|
Taylor, Alan D. |
|
2000 |
107 |
1-3 |
p. 203-214 12 p. |
article |