Leen Torenvliet

Available identifiers

zbMath Open torenvliet.leenMaRDI QIDQ230556

List of research outcomes

Publication	Date of Publication	Type
The malleability of TSP 2Opt	2024-02-28	Paper
A hierarchy of polynomial kernels	2020-10-22	Paper
On the cutting edge of relativization: The resource bounded injury method	2019-04-29	Paper
Sparse selfreducible sets and nonuniform lower bounds	2019-01-11	Paper
Fixed-parameter decidability: extending parameterized complexity analysis	2017-02-01	Paper
Hardness of approximation for knapsack problems	2015-05-29	Paper
Nonapproximability of the normalized information distance	2011-04-28	Paper
Non-uniform reductions	2010-10-06	Paper
Witness-isomorphic reductions and the local search problem (extended abstract)	2010-06-17	Paper
A Post's program for complexity theory.	2009-09-19	Paper
The value of agreement a new boosting algorithm	2008-06-10	Paper
Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds	2008-03-19	Paper
SOFSEM 2006: Theory and Practice of Computer Science	2006-11-14	Paper
Enumerations of the Kolmogorov function	2006-08-03	Paper
https://portal.mardi4nfdi.de/entity/Q4431234	2003-10-21	Paper
Two oracles that force a big crunch	2002-05-05	Paper
The communication complexity of enumeration, elimination, and selection	2002-04-11	Paper
Theory of semi-feasible algorithms	2002-04-01	Paper
Randomness is hard	2001-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4258589	2000-05-14	Paper
https://portal.mardi4nfdi.de/entity/Q4252736	2000-04-26	Paper
Separating Complexity Classes Using Autoreducibility	2000-03-19	Paper
https://portal.mardi4nfdi.de/entity/Q4218523	1999-10-10	Paper
Arithmetical Measure	1998-11-01	Paper
Splittings, Robustness, and Structure of Complete Sets	1998-05-10	Paper
https://portal.mardi4nfdi.de/entity/Q4348128	1997-09-22	Paper
\(p\)-selective self-reducible sets: a new characterization of P	1997-03-31	Paper
Optimal advice	1997-02-28	Paper
https://portal.mardi4nfdi.de/entity/Q4281519	1994-04-07	Paper
https://portal.mardi4nfdi.de/entity/Q4281494	1994-03-10	Paper
The relative power of logspace and polynomial time reductions	1994-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q4035688	1993-05-18	Paper
Completeness for nondeterministic complexity classes	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3976035	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q4729324	1989-01-01	Paper
Maintaining multiple representations of dynamic data structures	1989-01-01	Paper
Simplicity, immunity, relativizations and nondeterminism	1989-01-01	Paper
A second step toward the strong polynomial-time hierarchy	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3751005	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3740235	1985-01-01	Paper

Research outcomes over time

This page was built for person: Leen Torenvliet