1772 search results - page 80 / 355 » Classifying Problems into Complexity Classes |
103
click to vote
DLOG
2008
15 years 2 months ago
2008
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
121
click to vote
COCOON
2000
Springer
15 years 4 months ago
2000
Springer
We consider the parameterized complexity of the following problem under the framework introduced by Downey and Fellows[4]: Given a graph G, an integer parameter k and a non-trivial...
AIPS
2009
15 years 1 months ago
2009
A planning problem is k-dependent if each action has at most k pre-conditions on variables unaffected by the action. This concept is well-founded since k is a constant for all but...
102
Voted
CORR
2008
Springer
15 years 20 days ago
2008
Springer
Modal logics are widely used in computer science. The complexity of modal satisfiability problems has been investigated since the 1970s, usually proving results on a case-by-case b...
102
click to vote
ICNP
2005
IEEE
15 years 6 months ago
2005
IEEE
In this paper, we focus on the problem of identifying a family of collusion resistant protocols that demonstrate a tradeoff between the number of secrets that users maintain and t...