Christos H. Papadimitriou, Computational Complexity, Addison-Wesley Publishing Company ,1994. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
Technical Reports on Mathematical and Computing Sciences.. - Title The Complexity (Correct)
Automated Mechanism Design: Complexity Results Stemming.. - Conitzer, Sandholm (2003) (1 citation) (Correct)
Provably Secure Substitution of Cryptographic Tools - Kissner, Molnar (2006) (Correct)
Markov Indecision Processes: A Formal Model of Decision-Making.. - Bovik, al. (2003) (Correct)
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
Hierarchical Decision Making by Autonomous Agents - Heymans, Van Nieuwenborgh.. (2004) (Correct)
The Computational Complexity of Orientation Search.. - Mielikäinen.. (2004) (Correct)
Exponential Time Reductions and Sparse Languages in NEXP - Faliszewski (2004) (Correct)
Analyse Algorithmique de Systèmes Hybrides Polygonaux - Schneider (2002) (Correct)
Observations on Measure and Lowness for Δ_2^p - Lutz (Correct)
A Simple-Transition Model for - Relational Sequences Draft (Correct)
Staying Alive As Cheaply As Possible - Bouyer, Brinksma, Larsen (2004) (Correct)
Bulletin of the Section of Logic - Volume Pp Stephen (Correct)
Boolean Quantification - In First-Order Context (Correct)
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
The Computational Complexity of Orientation Search.. - Mielikäinen.. (2004) (Correct)
Testing the Equivalence of Disjunctive Logic Programs - Oikarinen (2003) (Correct)
Making Nondeterministic Computations - Unambiguous In Partial (1998) (Correct)
A Complete Problem for Statistical Zero Knowledge - Sahai, Vadhan (2002) (Correct)
Solving Optimization Problems among Selfish Agents - Ronen (2000) (6 citations) (Correct)
The Complexity Of Derivations Of Matrix Identities - Soltys-Kulinicz (2001) (Correct)
Computability Classes for Enforcement Mechanisms - Hamlen, Morrisett, Schneider (2003) (8 citations) (Correct)
Turing Machines, Transition Systems, and Interaction - Goldin, Smolka, al. (2004) (1 citation) (Correct)
Enumerations of the Kolmogorov Function - Richard Beigel Harry (Correct)
Structural and Computational Properties of Certain Permanents - Crespi (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC