MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Karchmer, Kushilevitz and Nisan formulated the formula size problem as an integer programming problem called the rectangle bound and introduced a technique called the LP bound, whi...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. In this paper we discuss the computational power of Lipschitz dynamical systems which are robust to infinitesimal perturbations. Whereas the study in [1] was done only f...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
A reduction system for regular expressions is presented. For a regular expression t, the reduction system is proved to terminate in a state where the most-reduced expression readil...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
We introduce Transformation Games (TGs), a form of coalitional game in which players are endowed with sets of initial resources, and have capabilities allowing them to derive certa...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer
Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classe...
MFCS
2010
Springer
13 years 3 months ago
2010
Springer