The following pages link to Leen Torenvliet (Q230556):
Displayed 40 items.
- Maintaining multiple representations of dynamic data structures (Q582046) (← links)
- Optimal advice (Q672755) (← links)
- Nonapproximability of the normalized information distance (Q716306) (← links)
- The value of agreement a new boosting algorithm (Q927875) (← links)
- Simplicity, immunity, relativizations and nondeterminism (Q1115610) (← links)
- The relative power of logspace and polynomial time reductions (Q1312179) (← links)
- Sparse selfreducible sets and nonuniform lower bounds (Q1755786) (← links)
- \(p\)-selective self-reducible sets: a new characterization of P (Q1816729) (← links)
- Non-uniform reductions (Q1959376) (← links)
- A hierarchy of polynomial kernels (Q2206255) (← links)
- Hardness of approximation for knapsack problems (Q2345987) (← links)
- Randomness is Hard (Q2706121) (← links)
- Fixed-parameter decidability: Extending parameterized complexity analysis (Q2958220) (← links)
- (Q3396548) (← links)
- Witness-isomorphic reductions and the local search problem (extended abstract) (Q3569019) (← links)
- (Q3740235) (← links)
- (Q3751005) (← links)
- A second step toward the strong polynomial-time hierarchy (Q3816982) (← links)
- (Q3976035) (← links)
- Completeness for nondeterministic complexity classes (Q3979608) (← links)
- (Q4035688) (← links)
- (Q4218523) (← links)
- (Q4252736) (← links)
- (Q4258589) (← links)
- (Q4281494) (← links)
- (Q4281519) (← links)
- (Q4348128) (← links)
- Splittings, Robustness, and Structure of Complete Sets (Q4388890) (← links)
- Arithmetical Measure (Q4393174) (← links)
- (Q4431234) (← links)
- On the cutting edge of relativization: The resource bounded injury method (Q4632432) (← links)
- (Q4729324) (← links)
- Separating Complexity Classes Using Autoreducibility (Q4943880) (← links)
- Sparse Selfreducible Sets and Polynomial Size Circuit Lower Bounds (Q5449821) (← links)
- Enumerations of the Kolmogorov function (Q5480623) (← links)
- SOFSEM 2006: Theory and Practice of Computer Science (Q5897993) (← links)
- The communication complexity of enumeration, elimination, and selection (Q5956009) (← links)
- Two oracles that force a big crunch (Q5957723) (← links)
- Theory of semi-feasible algorithms (Q5959347) (← links)
- The malleability of TSP 2Opt (Q6122219) (← links)