Stack Exchange

Laakeri

Helsinki, Finland

https://tuukkakorhonen.com/

MSc student in University of Helsinki. Interested in design, analysis and implementation of algorithms for NP-hard problems.

top accounts reputation activity bookmarks subscriptions

Top Questions

What percentage of SODA papers are galactic algorithms?

soft-question big-picture application-of-theory asked Mar 3 at 8:33

cstheory.stackexchange.com

Solving multiple easy ILP instances

mixed-integer-programming cplex c++ asked Jan 22 at 17:25

or.stackexchange.com

Time complexity of linear programming with small number of variables

reference-request linear-programming asked Feb 7 at 22:03

cs.stackexchange.com

Top Answers

Can a deterministic finite automaton ever go into an infinite loop?

cs.stackexchange.com

Best parameterized algorithm for maximum clique

cstheory.stackexchange.com

Implication of solving 3SUM problem of a certain size on the Exponential Time Hypothesis

cstheory.stackexchange.com

Finding simple fixed length paths in directed graphs

cstheory.stackexchange.com

conversion to DAG

cstheory.stackexchange.com

Is the isomorphism problem between posets represented by DAGs GI-complete?

cstheory.stackexchange.com

Space complexity for storing integers in Python

cs.stackexchange.com

Can current quantum computers decide languages that Turing Machines cannot?

cs.stackexchange.com

Is there an algorithm to minimize working set during a topological traversal?

cs.stackexchange.com

Given a list of strings, find every pair $(x,y)$ where $x$ is a substring of $y$. Possible to do better than $O(n^2)$?

cs.stackexchange.com