6142 search results - page 34 / 1229 » The Complexity of Partition Functions |
ARSCOM
2005
14 years 9 months ago
2005
We prove several results dealing with various counting functions for partitions of an integer into four squares of equal parity. Some are easy consequences of earlier work, but tw...
EURODAC
1994
IEEE
15 years 1 months ago
1994
IEEE
In this paper we introduce a method to partition UNITY system speci cations into software and hardware parts. This method considers di erent design possibilities and de nes cost f...
AAAI
2008
15 years 1 days ago
2008
Complex graphs, in which multi-type nodes are linked to each other, frequently arise in many important applications, such as Web mining, information retrieval, bioinformatics, and...
TNN
1998
14 years 9 months ago
1998
— In this paper, we present a novel approach to partitioning pattern spaces using a multiobjective genetic algorithm for identifying (near-)optimal subspaces for hierarchical lea...
COCO
2005
Springer
15 years 3 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...