1507 search results - page 10 / 302 » Separating Complexity Classes Using Structural Properties |
IJCAI
2003
13 years 8 months ago
2003
Disjunctive Logic Programming (DLP) is a very expressive formalism: it allows to express every property of finite structures that is decidable in the complexity class ¡£¢¤ (...
WWW
2004
ACM
14 years 8 months ago
2004
ACM
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
PODS
1994
ACM
13 years 11 months ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...
PAKDD
2004
ACM
14 years 24 days ago
2004
ACM
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
CSL
2005
Springer
14 years 29 days ago
2005
Springer
We show that Csanky’s fast parallel algorithm for computing the characteristic polynomial of a matrix can be formalized in the logical theory LAP, and can be proved correct in LA...