Theoretical Computer Science
Meta user
Network profile
1,010
reputation
5
15

Lieuwe Vinkhuijzen

Please message me if you have a short, elegant, funny or rhyming proof of something.

I'm a graduate student at Leiden University working on a thesis about quantum computing. The chapter about measurement is called Les Measurables.

What did the logician say to the politician who asked whether to put more or less logic in the curriculum? "Yes"

13
answers
3
questions
~5k
people reached
  • Member for 3 years, 11 months
  • 132 profile views
  • Last seen 5 hours ago

Communities (11)

Top network posts

Top tags (20)

Score 47
Posts 10
Posts % 62
Score 15
Posts 2
Score 15
Posts 1
Score 15
Posts 1
Score 15
Posts 1
Score 13
Posts 3
View all tags →

Top posts (16) All Questions Answers | Votes Newest

15 Possible to do Complexity theory with only counting and Pigeonhole Nov 18 '18
11 What is the name of a function $f$ such that $f(x,y) \in L \iff x\in L \wedge y \in L$? Dec 4 '16
10 Quantum polynomial hierarchy vs counting hierarchy Oct 10 '17
8 What are some problems in $P$ which have lower bounds assuming that $P \neq NP$ or the ETH? Sep 18 '17
8 Does $NP=PP$ collapse the counting hierarchy? Oct 9 '17
7 Complexity of 3SAT where each pair of 3-clauses share at most one variable Jul 1 '16
6 $\mathsf{NP^{PP}}$ vs $\mathsf{P^{PP}}$ Jul 17 '17
6 Quantum complexity separation evading the algebrization barrier? Jan 18 '17
5 Language in $PSPACE$ and not necessarily in $P$ if $P=PP$? Jun 22
4 $ZTIME(T(n))$ complexity $RTIME(T(n))$ Jan 26 '17
View all questions and answers →

Badges (20)

Gold

—

Silver

5

Rarest

Bronze

15

Rarest

View all badges →