|
| Books 1 - 10 of 10 | Previous | Next |


 |
 |  | Descriptive Complexity and Finite Models (Series in Discrete Mathematics & Theoretical Computer Science) by Neil Immerman (Editor), Phokion G. Kolaitis (Editor) Hardcover, 248 Pages, Published 1997 by American Mathematical Society
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Descriptive Complexity (Texts in Computer Science) (New title Edition) by Neil Immerman Hardcover, 268 Pages, Published 1999 by Springer-Verlag New York Inc., New title Edition
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Definability with bounded number of bound variables (Technical report. Cornell University. Department of Computer Science) by Neil Immerman Unknown Binding, 18 Pages, Published 1987 by Dept. of Computer Science, Cornell University
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Expressibility as a complexity measure: Results and directions (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, 23 Pages, Published 1987 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Expressibility and parallel complexity (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, 22 Pages, Published 1988 by Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Describing graphs: A first-order approach to graph canonization (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, 22 Pages, Published 1988 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Expressibility and parallel complexity (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, 19 Pages, Published 1987 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Nondeterministic space is closed under complement (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, Published 1987 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Relativizing relativized computations (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, 15 Pages, Published 1986 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
 |  | Relational queries computable in polynomial time (Technical report. Yale University. Dept. of Computer Science) by Neil Immerman Unknown Binding, Published 1985 by Yale University, Dept. of Computer Science
Compare Prices | Add to Wish List | Set Price Alert |


 |
| Books 1 - 10 of 10 | Previous | Next |