Discrete Applied Mathematics 2005: Vol 153 Index PDF
Preview Discrete Applied Mathematics 2005: Vol 153 Index
Available online at www.sciencedirect.com Wee is science @Poinecr: DISCRETE sal hee APPLIED MATHEMATICS ELSEVIER Discrete Applied Mathematics 153 (2005) 182 www.elsevier.com/locate/dam Author index to volume 153 Beacham, A. and J. Culberson, On the complexity of unfrozen problems Beame, P., J. Culberson, D. Mitchell and C. Moore, The resolution complexity of random graph k-colorability Creignou, N., H. Daude and J. Franco, A sharp threshold for the renameable-Horn and the q-Horn properties 48-57 Culberson, J., see A. Beacham 3—24 Culberson, J., see P. Beame 25-47 Culberson, J., see Y. Gao 124-140 Daude, H., see N. Creignou 48-57 Dimitriou, T., SAT distributions with planted assignments and phase transitions between decision and optimization problems Farago, A., On the typical case complexity of graph optimization Franco, J., Typical case complexity of Satisfiability Algorithms and the threshold phenomenon Franco, J., see N. Creignou Gao, Y. and J. Culberson, Resolution complexity of random constraint satisfaction problems: Another half of the story 124-140 Istrate, G., Threshold properties of random boolean constraint satisfaction problems Kirousis, L.M. and E. Kranakis, Editorial Kranakis, E., see L.M. Kirousis Mitchell, D., see P. Beame Moore, C., see P. Beame Voll, U., A novel giant-subgraph phase-transition in sparse random k-partite graphs 153-181 doi:10.1016/S0166-218X(05)00329-X
The list of books you might like
