1007 search results - page 55 / 202 » The Complexity of Futile Questioning |
168
click to vote
BMCBI
2011
14 years 7 months ago
2011
Background: Although homology-based methods are among the most widely used methods for predicting the structure and function of proteins, the question as to whether interface sequ...
111
click to vote
STOC
2002
ACM
16 years 4 months ago
2002
ACM
Let f : {0, 1}n {0, 1} be a boolean function. For 0 let D (f) be the minimum depth of a decision tree for f that makes an error for fraction of the inputs x {0, 1}n . We also ma...
111
click to vote
ADC
2007
Springer
15 years 10 months ago
2007
Springer
An ontology is increasingly becoming an essential tool for solving problems in many research areas. The ontology is a complex information object. It can contain millions of concep...
139
click to vote
IRI
2006
IEEE
15 years 10 months ago
2006
IEEE
The development of solutions to complex problems requires finding answers to several questions which are obstacles on the road leading to the solution. To perpetuate progress, the...
132
click to vote
CIE
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity status couldn't be solved by classifying it as being either NP-complete or solvabl...