Theoretical Computer Science
Yonatan N
  • Member for 11 years
  • Last seen this week
Profile Activity
Stats
1,614
reputation
10k
reached
24
answers
0
questions
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
38
Posts %
27
Score
8
Posts
33
Posts %
27
Score
6
Posts
25
Posts %
24
Score
4
Posts
17
Posts %
15
Score
4
Posts
17
Posts %
11
Score
4
Posts
17
Posts %
Top posts
View all questions and answers
All Questions Answers
Votes Newest
16
Best communication complexity lower bound of disjointness
Jan 25 '13
14
Questions regarding SETH
Aug 10 '16
10
What is the complexity of this path problem?
Feb 17 '14
9
What is the reference for the proof Gödel's first incompleteness theorem based on the undecidability of the halting problem?
Feb 15 '19
9
Proof of $LP$ is in $coNP$ without showing it is in $P$?
Sep 22 '20
8
Natural NP-complete problems with high density?
Nov 30 '15
7
Is there an efficient algorithm for finding edges that are part of all hamiltonian paths?
Jan 3 '14
6
All-or-Nothing Single-Sink Flow Problem
Oct 26 '18
5
Bootstrapping results that really bootstrap
Jul 8 '19
5
Choosing one number from each set so that the sum of squares of each distinct number counts is minimized
Jun 3 '20
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.