Call Number (LC) | Title | Results |
---|---|---|
QA267.7 .C677 1993 | Complexity theory : current research / | 1 |
QA267.7 .C677 2013eb |
Computability : Turing, Gödel, Church, and beyond / Computability Turing, Gödel, Church, and beyond / |
4 |
QA267.7 .C68 1998 |
Computational complexity and feasibility of data processing and interval computations Computational complexity and feasibility of data processing and interval computations / |
2 |
QA267.7 .C683 2006 | Computational complexity and statistical physics / | 1 |
QA267.7 .C683 2006eb | Computational complexity and statistical physics / | 1 |
QA267.7 .C685 2004 | Computational complexity theory / | 1 |
QA267.7.C695 2010 | Logical Foundations of Proof Complexity. | 1 |
QA267.7 .C695 2010 | Logical foundations of proof complexity / | 1 |
QA267.7 .C695 2010eb | Logical foundations of proof complexity / | 1 |
QA267.7 .C74 2001 | Complexity classifications of Boolean constraint satisfaction problems / | 1 |
QA267.7 .D47 1997 | Descriptive complexity and finite models : proceedings of a DIMACS workshop, January 14-17, 1996, Princeton University / | 1 |
QA267.7 .D483 2020eb | Algorithmic information theory for physicists and natural scientists / | 1 |
QA267.7 .D68 1999 |
Parameterized complexity Parameterized complexity / |
2 |
QA267.7 .D69 2008 | Algorithmic randomness and complexity / | 1 |
QA267.7 .D8 2000 | Theory of computational complexity / | 1 |
QA267.7 .E54 1996 | The emergence of complexity in mathematics, physics, chemistry and biology : proceedings, Plenary Session of the Pontifical Academy of Sciences, 27-31 October 1992 / | 2 |
QA267.7 .E73 2008 | Complexity explained / | 1 |
QA267.7 .F433 1995 | Feasible mathematics II / | 1 |
QA267.7 .F433 1995eb | Feasible mathematics II / | 1 |
QA267.7 .F58 2006eb | Parameterized complexity theory | 1 |