1507 search results - page 12 / 302 » Separating Complexity Classes Using Structural Properties |
102
click to vote
JSYML
2000
15 years 2 months ago
2000
Let K0 be the class of structures , <, A , where A is disjoint from a club, and let K1 be the class of structures , <, A , where A contains a club. We prove that if = &...
120
Voted
BMCBI
2006
15 years 2 months ago
2006
Background: A new method for the prediction of protein structural classes is constructed based on Rough Sets algorithm, which is a rule-based data mining method. Amino acid compos...
107
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
109
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prov...
121
click to vote
PODC
2006
ACM
15 years 8 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...