-
3
-
-
84957683448
-
-
voll, D.Z Du and P.M. Pardalos Eds, Kluwer Academic Publishers
-
R. Battiti and M. Protasi, ’Approximate algorithms and heuristics for MAX-SAT”, Handbook of combinatorial optimization, voll, D.Z Du and P.M. Pardalos Eds, Kluwer Academic Publishers, (1998), 77-148.
-
(1998)
’Approximate Algorithms and Heuristics for MAX-SAT”, Handbook of Combinatorial Optimization
, pp. 77-148
-
-
Battiti, R.1
Protasi, M.2
-
5
-
-
0020766331
-
An overview of computational complexity
-
S.A. Cook, ’An overview of computational complexity’, communications of the ACM, vol 26, 6(1983), 401-408.
-
(1983)
Communications of the ACM
, vol.26
, Issue.6
, pp. 401-408
-
-
Cook, S.A.1
-
8
-
-
84947801631
-
A Monte Carlo algorithm for the satisfiability problem
-
Springer Verlag Benicassim, Spain, (June
-
II. Drias, A Monte Carlo algorithm for the satisfiability problem, in Proc of IEA-A1E 98, lectures notes in Artificial Intelligence, Springer Verlag Benicassim, Spain, (June 1998).
-
(1998)
Proc of IEA-A1E 98, Lectures Notes in Artificial Intelligence
-
-
Drias, I.I.1
-
10
-
-
84957684520
-
-
TR 15/95 Dipartimento di informatica, university of Pisa
-
G. Gallo, C. Gentile, D. Pretolani and G. Rago, ’Max Horn SAT and the minimum cut problem in directed hypergraphs’, TR 15/95 Dipartimento di informatica, university of Pisa, (1995).
-
(1995)
Max Horn SAT and the Minimum Cut Problem in Directed hypergraphs
-
-
Gallo, G.1
Gentile, C.2
Pretolani, D.3
Rago, G.4
-
12
-
-
0028368125
-
Genetic algorithms and Tabu search: Hybrids for optimization
-
F. Glover, J.P. Kelly and M. Laguna, ’Genetic algorithms and Tabu search: Hybrids for optimization’, Computers op Res, voi 22 1(1995), 111-134.
-
(1995)
Computers Op Res, Voi
, vol.22
, Issue.1
, pp. 111-134
-
-
Glover, F.1
Kelly, J.P.2
Laguna, M.3
-
13
-
-
84893574327
-
Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
-
M.X. Goemans and D.P. Williamson, ’ Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming’, Journal of the ACM, 42(1995), 1115-1145
-
(1995)
Journal of the ACM
, vol.42
, pp. 1115-1145
-
-
Goemans, M.X.1
Williamson, D.P.2
-
15
-
-
0028444541
-
Global Optimization for satisfiability (SAT) Problem
-
J. Gu, ’Global Optimization for satisfiability (SAT) Problem’, IEEE Transactions on knowledge and data engineering, voi 6, 3(1994), 361-381
-
(1994)
IEEE Transactions on Knowledge and Data Engineering
, vol.6
, Issue.3
, pp. 361-381
-
-
Gu, J.1
-
16
-
-
0025260212
-
Algorithms for the maximum satisfiability problem
-
P. Hansen and B. Jaumard, ’Algorithms for the maximum satisfiability problem’, computing, 44(1990), 279-303.
-
(1990)
Computing
, vol.44
, pp. 279-303
-
-
Hansen, P.1
Jaumard, B.2
-
19
-
-
84976762344
-
Complexity of partial satisfaction
-
K.J. Lieberherr and E. Specker, ’ Complexity of partial satisfaction’, Journal of the ACM, voi 28 2(1981), 411-421.
-
(1981)
Journal of the ACM
, vol.28
, Issue.2
, pp. 411-421
-
-
Lieberherr, K.J.1
Specker, E.2
-
21
-
-
0027002161
-
Hard and easy distributions of SAT problems
-
San Jose, CA
-
D. Mitchell, B. Selman and II. J. Levesque, Hard and easy distributions of SAT problems, in proc of the tenth conference on Artificial Intelligence (AAAI-92), San Jose, CA, (July 1992), 440-440.
-
(1992)
Proc of the Tenth Conference on Artificial Intelligence (AAAI-92)
-
-
Mitchell, D.1
Selman, B.2
Levesque, I.I.J.3
-
23
-
-
0347557519
-
A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem
-
S. Poljnk and I, Turzik, ’A polynomial algorithm for constructing a large bipartite subgraph with an application to a satisfiability problem’, Can Journ Math, vol 34, 3(1982),519-524.
-
(1982)
Can Journ Math
, vol.34
, Issue.3
, pp. 519-524
-
-
Poljnk, S.1
-
24
-
-
0027001335
-
’A New method for solving hard satisfiability problems
-
San Jose, CA
-
Selman B, H. Levesque and D. Mitchell, ’A New method for solving hard satisfiability problems’, in proc of the 'lentil national conference on Artificial Intelligence (AAAI-92), San Jose, CA, (1992), 440-446.
-
(1992)
Procof the 'Lentil National Conference on Artificial Intelligence (AAAI-92)
, pp. 440-446
-
-
Selman, B.1
Levesque, H.2
Mitchell, D.3
-
26
-
-
0028574681
-
Noise strategies for improving local search
-
Seattle, wa, (July
-
B. Selman, II.A. Kautz and B. Cohen, ’Noise strategies for improving local search’, in proc of the national conference on Artificial Intelligence (AAAI-94), Seattle, wa, (July 1994).
-
(1994)
Proc of the National Conference on Artificial Intelligence (AAAI-94)
-
-
Selman, B.1
Kautz, I.2
Cohen, B.3
|