Sciweavers

MFCS
2010
Springer
13 years 5 months ago
Robust Computations with Dynamical Systems
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...
Olivier Bournez, Daniel S. Graça, Emmanuel ...
MFCS
2010
Springer
13 years 5 months ago
Information Complexity of Online Problems
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...
Juraj Hromkovic, Rastislav Královic, Richar...
MFCS
2010
Springer
13 years 5 months ago
Resource Combinatory Algebras
Abstract. We initiate a purely algebraic study of Ehrhard and Regnier’s resource λ-calculus, by introducing three equational classes of algebras: resource combinatory algebras, ...
Alberto Carraro, Thomas Ehrhard, Antonino Salibra
MFCS
2010
Springer
13 years 5 months ago
Parameterized Complexity and Kernelizability of Max Ones and Exact Ones Problems
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...
Stefan Kratsch, Dániel Marx, Magnus Wahlstr...
MFCS
2010
Springer
13 years 5 months ago
Semi-linear Parikh Images of Regular Expressions via Reduction
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...
Bahareh Badban, Mohammad Torabi Dashti
MFCS
2010
Springer
13 years 5 months ago
Proof Systems and Transformation Games
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...
Yoram Bachrach, Michael Zuckerman, Michael Wooldri...
MFCS
2010
Springer
13 years 5 months ago
Persistent Homology under Non-uniform Error
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...
Paul Bendich, Herbert Edelsbrunner, Michael Kerber...
MFCS
2010
Springer
13 years 5 months ago
The Multivariate Resultant Is NP-hard in Any Characteristic
Bruno Grenet, Pascal Koiran, Natacha Portier
MFCS
2010
Springer
13 years 5 months ago
Harnessing MLF with the Power of System F
We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
Giulio Manzonetto, Paolo Tranquilli
MFCS
2010
Springer
13 years 5 months ago
Meta-Envy-Free Cake-Cutting Protocols
This paper discusses cake-cutting protocols when the cake is a heterogeneous good that is represented by an interval in the real line. We propose a new desirable property, the meta...
Yoshifumi Manabe, Tatsuaki Okamoto