Zobrazeno 1 - 10
of 146
pro vyhledávání: '"Torenvliet, Leen"'
Publikováno v:
SOFSEM 2019: Theory and Practice of Computer Science 504-518
In parameterized algorithmics, the process of kernelization is defined as a polynomial time algorithm that transforms the instance of a given problem to an equivalent instance of a size that is limited by a function of the parameter. As, afterwards,
Externí odkaz:
http://arxiv.org/abs/1902.11006
Autor:
Witteveen, Jouke, Torenvliet, Leen
Asking which sets are fixed-parameter tractable for a given parameterization constitutes much of the current research in parameterized complexity theory. This approach faces some of the core difficulties in complexity theory. By focussing instead on
Externí odkaz:
http://arxiv.org/abs/1709.04699
Normalized information distance (NID) uses the theoretical notion of Kolmogorov complexity, which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program. This practi
Externí odkaz:
http://arxiv.org/abs/1006.3275
Normalized information distance (NID) uses the theoretical notion of Kolmogorov complexity, which for practical purposes is approximated by the length of the compressed version of the file involved, using a real-world compression program. This practi
Externí odkaz:
http://arxiv.org/abs/0910.4353
We prove that P-sel, the class of all P-selective sets, is EXP-immune, but is not EXP/1-immune. That is, we prove that some infinite P-selective set has no infinite EXP-time subset, but we also prove that every infinite P-selective set has some infin
Externí odkaz:
http://arxiv.org/abs/cs/0504096
A set is autoreducible if it can be reduced to itself by a Turing machine that does not ask its own input to the oracle. We use autoreducibility to separate the polynomial-time hierarchy from polynomial space by showing that all Turing-complete sets
Externí odkaz:
http://arxiv.org/abs/math/9807185
Autor:
Torenvliet, Leen, Trautwein, Marten
The recognition problem for attribute-value grammars (AVGs) was shown to be undecidable by Johnson in 1988. Therefore, the general form of AVGs is of no practical use. In this paper we study a very restricted form of AVG, for which the recognition pr
Externí odkaz:
http://arxiv.org/abs/cmp-lg/9503021
Publikováno v:
In Journal of Computer and System Sciences 2011 77(4):738-742
Autor:
Beigel, Richard, Buhrman, Harry, Fejer, Peter, Fortnow, Lance, Grabowski, Piotr, Longpré, Luc, Muchnik, Andrej, Stephan, Frank, Torenvliet, Leen
Publikováno v:
The Journal of Symbolic Logic, 2006 Jun 01. 71(2), 501-528.
Externí odkaz:
https://www.jstor.org/stable/27588463
Autor:
Leskes, Boaz, Torenvliet, Leen
Publikováno v:
In Journal of Computer and System Sciences 2008 74(4):557-586