Call Number (LC) Title Results
QA267.7 .B87 1997 Algebraic complexity theory / 1
QA267.7 .B88 2000 Completeness and reduction in algebraic complexity theory / 1
QA267.7 .C35 1993 Advances in computational complexity theory / 1
QA267.7 .C37 2000 A graphic apology for symmetry and implicitness / 1
QA267.7 .C53 2004 Classical and new paradigms of computation and their complexity hierarchies : papers of the conference "Foundations of the Formal Sciences III" / 1
QA267.7 .C53 2004eb Classical and new paradigms of computation and their complexity hierarchies : papers of the conference "Foundations of the Formal Sciences III" / 1
QA267.7 .C58 2002 Boolean functions and computation models / 1
QA267.7 .C64 2019 Cognition and intractability : a guide to classical and parameterized complexity analysis / 1
QA267.7 .C66 1989 1989 lectures in complex systems : the proceedings of the 1989 Complex Systems Summer School, Santa Fe, New Mexico, June 1989 / 1
QA267.7 .C66 1990 1990 lectures in complex systems : the proceedings of the 1990 Complex Systems Summer School, Santa Fe, New Mexico, June 1990 / 1
QA267.7 .C66 2012 Computational complexity theory, techniques, and applications / 1
QA267.7 .C664 1997 Complexity, logic, and recursion theory / 1
QA267.7 .C664 1997eb Complexity, logic, and recursion theory 1
QA267.7 .C664 2019eb Complexity, logic, and recursion theory / 1
QA267.7 .C665 Complexity. 1
QA267.7 .C67 1990 Complexity theory retrospective : in honor of Juris Hartmanis on the occasion of his sixtieth birthday, July 5, 1988 / 1
QA267.7 .C674 1997 Complexity theory retrospective II / 1
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