|
351 |
Approximation, randomization, and combinatorial optimization Berlin : Springer, 2011
|
|
|
352 |
Average time complexity of decision trees Chikalov, Igor. - Berlin : Springer, 2011
|
|
|
353 |
Beyond sets Rescher, Nicholas. - Frankfurt, M. [i.e. Heusenstamm] : Ontos-Verl., 2011
|
|
|
354 |
Clausal relations and C-clones Vargas García, Edith Mireya, 2011
|
|
|
355 |
Clones of partial functions on finite sets Schölzel, Karsten. - Aachen : Shaker, 2011
|
|
|
356 |
Combinatorial algorithms Berlin : Springer, 2011
|
|
|
357 |
Combinatorial algorithms Berlin : Springer, 2011
|
|
|
358 |
Computational geometry, graphs and applications Berlin : Springer, 2011
|
|
|
359 |
Conditionals and modularity in general logics Gabbay, Dov M.. - Berlin : Springer, 2011
|
|
|
360 |
Contraction-based separation and lifting for solving the max-cut problem Bonato, Thorsten, 2011
|
|