1772 search results - page 141 / 355 » Classifying Problems into Complexity Classes |
199
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We consider the computational complexity of pure Nash equilibria in graphical games. It is known that the problem is NP-complete in general, but tractable (i.e., in P) for special...
178
click to vote
COCOON
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. Hierarchical graphs are an important class of graphs for modelling many real applications in software and information visualization. In this paper, we shall investigate t...
155
click to vote
CJ
2010
15 years 6 months ago
2010
How best to quantify the information of an object, whether natural or artifact, is a problem of wide interest. A related problem is the computability of an object. We present prac...
175
click to vote
PODS
2010
ACM
15 years 11 months ago
2010
ACM
We investigate a higher-order query language that embeds operators of the positive relational algebra within the simply-typed λ-calculus. Our language allows one to succinctly de...
186
click to vote
CSL
2009
Springer
15 years 10 months ago
2009
Springer
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...