<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2009-08-14 00:50:42Computational complexity theory Complexity classes Theory of computation FO PSPACE SO P EXPTIME Boolean algebra Co-NP-complete Reduction Descriptive complexity theory |
Add to Reading List |
Introduction & Motivation Relations and Operations Boolean and 3-element cases | Introduction & Motivation Relations and Operations Boolean and 3-element casesDocID: 1qCnb - View Document |
| P-matrix recognition is co-NP-complete Jan Foniok ETH Zurich, Institute for Operations Research R¨amistrasse 101, 8092 Zurich, SwitzerlandDocID: 1p3MJ - View Document |
| b-coloring is NP-hard on co-bipartite graphs and polytime solvable on tree-cographs ∗ Flavia Bonomo1 , Oliver Schaudt2 , Maya Stein3 , and Mario Valencia-Pabon†4 1DocID: 1m4Jl - View Document |
| PHOTO: V. SLADON 175 YEARS – 50 GREAT CATHOLICS / Michael Walsh on Barbara Ward A friend, a retired senior lecturer on internationalDocID: 17QL6 - View Document |
| The Complexity of Global Constraints Christian Bessiere Emmanuel Hebrard and Brahim Hnich and Toby Walsh∗ LIRMMDocID: 17JXD - View Document |