Sciweavers

2233 search results - page 143 / 447
» On the Complexity of Theory Curbing
Sort
View
BIOSYSTEMS
2008
111views more  BIOSYSTEMS 2008»
15 years 6 months ago
Autonomy and hypersets
This paper has two primary aims. The first is to provide an introductory discussion of hyperset theory and its usefulness for modeling complex systems. The second aim is a hyperset...
Anthony Chemero, Michael T. Turvey
CORR
2006
Springer
78views Education» more  CORR 2006»
15 years 6 months ago
What is the probability of connecting two points ?
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...
Christian Tanguy
DAM
2007
67views more  DAM 2007»
15 years 6 months ago
The state of SAT
The papers in this special issue originated at SAT 2001, the Fourth International Symposium on the Theory and Applications of Satisfiability Testing. This foreword reviews the cu...
Henry A. Kautz, Bart Selman
APAL
2005
119views more  APAL 2005»
15 years 6 months ago
Elementary arithmetic
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...
Geoffrey E. Ostrin, Stanley S. Wainer
EATCS
2002
141views more  EATCS 2002»
15 years 6 months ago
Recent Developments in Explicit Constructions of Extractors
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
Ronen Shaltiel