Searching for "The complexity of partition functions." – sorted by Relevance.
-
A polynomiality property for Littlewood-Richardson coefficients
- by polynomials in λ, µ and ν on the cones of the chamber complex of a vector partition function. We give bounds
- Cited by 11 (1 self) – Add To MetaCart
-
Phase Transition Strengths From the Density of Partition Function Zeroes
- the reduced temperature and h the external field, then the FSS of the j th complex partition function zero
- Cited by 1 (0 self) – Add To MetaCart
-
The problem with rights expression languages
- with this complexity. The partitioning of functionality along the lines of what has been described in Section 3
- Cited by 1 (0 self) – Add To MetaCart
-
unknown title
- The complexity of partition functions Andrei Bulatov1 and Martin Grohe2 1 Computing Laboratory
- Add To MetaCart
-
Analysis of Interacting Nucleic Acids in Dilute Solutions
- for complexes of interacting strands. With partition functions in hand, the unique complex concentrations
- Cited by 1 (0 self) – Add To MetaCart
-
Density of Partition function Zeroes and Phase Transition Strength
- of the j th complex partition function zero (for large j) is given by [1] t j (L) # # j/L d # 1/#d
- Add To MetaCart
-
scaling correction of the
- ), for instance by ana- lyzing the partition function zeros in the complex temperature plane[11, 12
- Add To MetaCart
-
Predictive Energy-Efficient Multicast for Large-Scale Mobile Ad Hoc Networks
- the PARTITION function |R| times. The complexity of the PARTITION function is O(|R| log|R|) because
- Add To MetaCart
-
unknown title
- the exploration of the density of complex zeros of the canonical partition function for finite and small systems
- Add To MetaCart
-
Selection of Examples for a Linear Classifier
- . In order to keep integrals finite, we will work with the following complex partition function Z = Z Y j
- Cited by 1 (0 self) – Add To MetaCart

