Results from the 2022 Developer Survey are now available
Theoretical Computer Science
user avatar
user avatar
user avatar
Yonatan N
  • Member for 11 years, 5 months
  • Last seen this week
Profile Activity
Stats
1,624
reputation
10k
reached
25
answers
0
questions
top 13% overall
Communities
View all
About

I work on algorithms for Amazon's Elasticsearch team.

Badges
View all badges
This user doesn’t have any gold badges yet.
14
silver badges
21
bronze badges
Top tags
View all tags
50
Score
9
Posts
36
Posts %
27
Score
8
Posts
32
Posts %
27
Score
6
Posts
24
Posts %
24
Score
4
Posts
16
Posts %
15
Score
4
Posts
16
Posts %
11
Score
4
Posts
16
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
answer
16
Best communication complexity lower bound of disjointness
Jan 25, 2013
answer
14
Questions regarding SETH
Aug 10, 2016
answer
10
What is the complexity of this path problem?
Feb 17, 2014
answer
9
What is the reference for the proof Gödel's first incompleteness theorem based on the undecidability of the halting problem?
Feb 15, 2019
answer
9
Proof of $LP$ is in $coNP$ without showing it is in $P$?
Sep 22, 2020
answer
8
Natural NP-complete problems with high density?
Nov 30, 2015
answer
7
Is there an efficient algorithm for finding edges that are part of all hamiltonian paths?
Jan 3, 2014
answer
6
All-or-Nothing Single-Sink Flow Problem
Oct 26, 2018
answer
5
Bootstrapping results that really bootstrap
Jul 8, 2019
answer
5
Choosing one number from each set so that the sum of squares of each distinct number counts is minimized
Jun 3, 2020
Top network posts
View all network posts
33
Fastest yes in the west
24
Examples of notably long or difficult proofs that only improve upon existing results by a small amount
22
Continued fraction for $\frac{1}{e-2}$
22
Working With Large Exponents
8
Generate string with large Kolmogrov complexity

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.