EATCS
2002
13 years 10 months ago
2002
EATCS
2002
13 years 10 months ago
2002
Abstract. This paper provides a comprehensive summary of equivalence checking results for infinite-state systems. References to the relevant papers will be updated continuously acc...
EATCS
2002
13 years 10 months ago
2002
Extractors are functions which are able to "extract" random bits from arbitrary distributions which "contain" sufficient randomness. Explicit constructions of ...
EATCS
2002
13 years 10 months ago
2002
We solve the general case of the bridge-crossing puzzle. 1 The Puzzle Four people begin on the same side of a bridge. You must help them across to the other side. It is night. The...
EATCS
2002
13 years 10 months ago
2002
We explain the essence of K. Mulmuley and M. Sohoni, "Geometric Complexity Theory I: An Approach to the P vs. NP and Related Problems" [MS02] for a general complexity-the...
EATCS
2002
13 years 10 months ago
2002
EATCS
2002
13 years 10 months ago
2002
EATCS
2002
13 years 10 months ago
2002
Nature is not only a source of minerals and precious stones but is also a mine of algorithms. By observing and studying natural phenomena, computer algorithms can be extracted. In...
EATCS
2002
13 years 10 months ago
2002
This article introduces three of the twentieth century's main philosophies of mathematics and argues that of those three, one describes mathematical reality, the \reality&quo...