Theoretical Computer Science
Dominic van der Zypen's user avatar
Dominic van der Zypen's user avatar
Dominic van der Zypen's user avatar
Dominic van der Zypen
  • Member for 9 years, 2 months
  • Last seen more than a month ago
Profile Activity
Stats
859
reputation
8k
reached
0
answers
9
questions
Communities
View all
About

Graph theory, infinite combinatorics, topology, order theory.

Badges
View all badges
This user doesn’t have any gold badges yet.
6
silver badges
16
bronze badges
Top tags
View all tags
0
Score
2
Posts
22
Posts %
0
Score
2
Posts
22
Posts %
0
Score
2
Posts
22
Posts %
0
Score
2
Posts
22
Posts %
0
Score
1
Posts
11
Posts %
0
Score
1
Posts
11
Posts %
Top posts
All Questions Answers
Score Newest
question
23
Statements that imply $\mathbf{P}\neq \mathbf{NP}$
Oct 10, 2014
question
18
In the neutral zone between polynomial and sub-exponential
Jun 20, 2020
question
14
Computability of a "weird" set
Oct 26, 2017
question
10
Formulating P vs NP without Turing machines
Jul 3
question
4
Representation as sum of unit fractions: primitive recursive?
Jan 2, 2015
question
1
Fibers of hash functions
Dec 4, 2020
question
0
"Fair" hash functions
Dec 25, 2020
question
0
Is "choosability of subsets" NP-hard?
Jun 7, 2022
question
0
Minimal-size extending set in a directed graph
Oct 28, 2015
Top network posts
View all network posts
57
In what respect are univalent foundations "better" than set theory?
47
Generalizations of the four-color theorem
33
Connectedness in the language of path-connectedness
33
Decision problems for which it is unknown whether they are decidable
30
Is $\mathbb{R}\cong\text{Cont}(X,Y)$ for some non-trivial spaces $X,Y$?

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.