1772 search results - page 215 / 355 » Classifying Problems into Complexity Classes |
FOCS
2005
IEEE
15 years 6 months ago
2005
IEEE
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a wide variety of r...
87
Voted
ICLP
1999
Springer
15 years 5 months ago
1999
Springer
In this paper, we focus on the problem of existence of and computing small and large stable models. We show that for every xed integer k, there is a linear-time algorithm to decid...
112
click to vote
ICLP
2005
Springer
15 years 6 months ago
2005
Springer
Abstract Description Logics (DLs) are a family of class (concept) based knowledge representation formalisms. They are characterised by the use of various constructors to build comp...
103
click to vote
FOCS
1997
IEEE
15 years 5 months ago
1997
IEEE
We prove old and new results on the complexity of computing the dimension of algebraic varieties. In particular, we show that this problem is NP-complete in the Blum-Shub-Smale mo...
92
Voted
ITICSE
1997
ACM
15 years 5 months ago
1997
ACM
A programming exercise on recursion in which students create drawings of simple and bracketed Lindenmayer Systems provides a context for exploring additional computer science conc...