Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley Publishing, Co. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Efficient Linkage Discovery by Limited Probing - Heckendorn, Wright (2003) (4 citations) (Correct)
No context found.
Papadimitriou, C. H. (1994). Computational Complexity. Addison-Wesley Publishing, Co.
A Topological Constraint Language with - Component Counting Ian (Correct)
No context found.
PAPADIMITRIOU C. H., Computational Complexity, Addison-Wesley, Reading, MA, 1994.
Fixed Parameter Algorithms for - Planar Dominating Set (2000) (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
The Complexity of XPath Query Evaluation - Georg Gottlob Database (2003) (11 citations) (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
Monadic Datalog and the Expressive Power of - Languages For Web (Correct)
No context found.
Papadimitriou, C. H. 1994. Computational Complexity. Addison-Wesley.
Query Rewriting with Symmetric - Constraints Christoph Koch (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
Computing Shapley Values, Manipulating Value Division.. - Conitzer, Sandholm (2004) (Correct)
No context found.
Papadimitriou, C. H. 1995. Computational Complexity. Addison-Wesley.
Upper Bounds for Vertex Cover - Further Improved Rolf (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
ViCo: A Metric for the Complexity of - Information Visualizations Johannes (2002) (Correct)
No context found.
Papadimitriou, C. H.: Computational Complexity Addison Wesley, Reading, Mass. [u.a.], (1994).
Issues in Multiagent Resource Allocation - Chevaleyre, Dunne, al. (2006) (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
Complexity of Hybrid Logics over Transitive Frames - Mundhenk, Schneider.. (Correct)
No context found.
Papadimitriou, C. H., "Computational Complexity," Addison-Wesley, 1994.
Confronting Hardness Using a Hybrid Approach - Vassilevska, Williams, Woo (2005) (Correct)
No context found.
C. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
An Abduction-based Method for Index - Relaxation In Taxonomy-Based (2003) (Correct)
No context found.
C.H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
Mining the Meaningful Term Conjunctions from Materialised.. - Tzitzikas, Analyti (Correct)
No context found.
C.H. Papadimitriou. Computational complexity. Addison-Wesley, 1994.
Fixing Inconsistent Databases by Updating Numerical.. - Leopoldo Bertossi Loreto (Correct)
No context found.
Papadimitriou, Ch. Computational Complexity. Addison-Wesley, 1994.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Papadimitriou, Ch.Computational Complexity. Addison-Wesley, 1994.
Deadlock And Reachability Checking With Finite Complete Prefixes - Heljanko (1999) (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.
Model-Based Runtime Analysis of Distributed Reactive Systems - Bauer, Leucker, Schallhart (Correct)
No context found.
C. H. Papadimitriou. Computational Complexity. AddisonWesley, New York, 1994.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Papadimitriou, Ch.Computational Complexity. Addison-Wesley, 1994.
Complexity and Approximation of Fixing - Numerical Attributes In (Correct)
No context found.
Papadimitriou, Ch.Computational Complexity. Addison-Wesley, 1994.
On Optimal Service Selection - Bonatti, Festa (2005) (Correct)
No context found.
C. Papadimitriou. Computational complexity. Addison Wesley, 1994.
The Demand Matching Problem - Shepherd, Vetta (2002) (Correct)
No context found.
C. Papadimitriou, Computational Complexity, Addison Wesley, 1994.
On Optimal Service Selection - Bonatti, Festa (2005) (Correct)
No context found.
C. Papadimitriou. Computational complexity. Addison Wesley, 1994.
Fixing Numerical Attributes Under Integrity - Constraints Leopoldo Bertossi (Correct)
No context found.
Papadimitriou, Ch.Computational Complexity. Addison-Wesley, 1994.
On The Logic Of Cooperation And Propositional Control - van der Hoek, Wooldridge (2005) (1 citation) (Correct)
No context found.
C.H. Papadimitriou, Computational Complexity, Addison-Wesley, Reading, MA, 1994.
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