6142 search results - page 64 / 1229 » The Complexity of Partition Functions |
DAC
2002
ACM
15 years 10 months ago
2002
ACM
This paper addresses the problem of automatic generation of implementation software from high-level functional specifications in the context of embedded system on chip designs. So...
ACSD
2010
IEEE
14 years 7 months ago
2010
IEEE
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
HPDC
1994
IEEE
15 years 1 months ago
1994
IEEE
Partitioning data parallel computations across a network of heterogeneous workstations is a dificult problem for the user: We have developed a runtime partitioning methodfor choos...
COMBINATORICS
2006
14 years 9 months ago
2006
We find the number of partitions of n whose BG-rank is j, in terms of pp(n), the number of pairs of partitions whose total number of cells is n, giving both bijective and generati...
JCT
2007
14 years 9 months ago
2007
We show that certain modular equations and theta function identities of Ramanujan imply elegant partition identities. Several of the identities are for t-cores. Key Words: partitio...