6142 search results - page 530 / 1229 » The Complexity of Partition Functions |
114
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
The two-terminal reliability, known as the pair connectedness or connectivity function in percolation theory, may actually be expressed as a product of transfer matrices in which t...
185
click to vote
CORR
2006
Springer
15 years 7 months ago
2006
Springer
An infinite word has the property Rm if every factor has exactly m return words. Vuillon showed that R2 characterizes Sturmian words. We prove that a word satisfies Rm if its compl...
196
click to vote
IPL
2006
15 years 7 months ago
2006
A precise analysis of the retrieval of signature trees is presented. A signature tree is a data structure constructed over a signature file to speed up searching all those signatu...
175
click to vote
APAL
2005
15 years 7 months ago
2005
Abstract. There is a very simple way in which the safe/normal variable discipline of Bellantoni-Cook recursion (1992) can be imposed on arithmetical theories like PA: quantify over...
169
click to vote
EATCS
2002
15 years 6 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...