6142 search results - page 45 / 1229 » The Complexity of Partition Functions |
122
click to vote
CSR
2011
Springer
14 years 1 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
BMCBI
2010
14 years 9 months ago
2010
Background: Phylogenetic analysis can be used to divide a protein family into subfamilies in the absence of experimental information. Most phylogenetic analysis methods utilize mu...
IJCAI
2003
14 years 11 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 ¡£¢¤ (...
CPHYSICS
2011
14 years 4 months ago
2011
We present an acceleration of the well-established Krylov-Ritz methods to compute the sign function of large complex matrices, as needed in lattice QCD simulations involving the o...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
In this paper, we analyze two general-purpose encoding types, trees and graphs systematically, focusing on trends over increasingly complex problems. Tree and graph encodings are ...