2022 Developer Survey is open! Take survey.
Theoretical Computer Science
user avatar
user avatar
user avatar
Janne H. Korhonen
  • Member for 11 years, 9 months
  • Last seen more than 4 years ago
Profile Activity
Stats
1,474
reputation
11k
reached
12
answers
1
question
Communities
About

Postdoctoral researcher at Aalto University

Badges
View all badges
This user doesn’t have any gold badges yet.
11
silver badges
14
bronze badges
Top tags
View all tags
56
Score
7
Posts
54
Posts %
55
Score
4
Posts
31
Posts %
55
Score
2
Posts
15
Posts %
39
Score
1
Posts
8
Posts %
37
Score
5
Posts
38
Posts %
19
Score
2
Posts
15
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
39
Which interesting theorems in TCS rely on the Axiom of Choice? (Or alternatively, the Axiom of Determinacy?)
Oct 5, 2010
answer
23
Time complexity analysis for Reingold's UST-CONN algorithm
Sep 8, 2010
answer
16
Algorithmic lens in the social sciences
May 4, 2011
answer
16
Smallest set not included in a collection of sets
Dec 20, 2012
question
14
SERF-reducibility and subexponential algorithms
Dec 1, 2011
answer
13
Is there any other algorithm whose worst-case running time is exponential meanwhile it works very well in practice other than Simplex Algorithm?
Nov 18, 2010
answer
9
What is the fastest way to check for set inclusion?
Jan 29, 2012
answer
7
Treewidth and Packing
Feb 19, 2012
answer
5
Pattern matching with don't cares: multiple patterns
Nov 4, 2016
answer
4
Algebraic formulation for packing problem
Feb 7, 2012

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.