Discrete Applied Mathematics 2000: Vol 107 Index PDF
Preview Discrete Applied Mathematics 2000: Vol 107 Index
DISCRETE APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 107 (2000) 261 Author Index Volume 107 (2000) Buning, H.K., On subclasses of minimal unsatisfiable formulas Foldes, S. and P.L. Hammer, Disjunctive and conjunctive normal forms of pseudo- Boolean functions Genisson, R. and P. Jegou, On the relations between SAT and CSP enumerative algorithms Hammer, P.L., see S. Foldes Hochbaum, D.S. and A. Pathria, Approximating a generalization of MAX 2SAT and MIN 2SAT Ibaraki, T., see H. Nagamochi Jégou, P., see R. Génisson Klasner, N. and H.U. Simon, General lower bounds on the query complexity within the exact learning model Kullmann, O., Investigations on autark assignments Marichal, J.-L., The influence of variables on pseudo-Boolean functions with applications to game theory and multicriteria decision making Nagamochi, H. and T. Ibaraki, Polyhedral structure of submodular and posi-modular systems Pathria, A., see D.S. Hochbaum Simon, H.U., see N. Klasner Takenaga, Y. and S. Yajima, Hardness of identifying the minimum ordered binary decision diagram laylor, A.D. and W.S. Zwicker, Trading properties and Alexandrov kernels for Boolean functions Ueda, T., Reflectiveness and compression of threshold transformations van Maaren, H. and J.P. Warners, Bounds and fast approximation algorithms for binary quadratic optimization problems with application to MAX 2SAT van Maaren, H., see J.P. Warners Warners, J.P. and H. van Maaren, Solving satisfiability problems using elliptic approxi- mations — effective branching rules Warners, J.P., see H. van Maaren Yajima, S., see Y. Takenaga Zwicker, W.S., see A.D. Taylor Elsevier Science B.V. TTaatA yaBeeeS a neee ed
The list of books you might like
