Lieuwe Vinkhuijzen

Member for 5 years, 11 months

Reputation

4,156

4.2k
3.9k
3.6k

2018
2019
2020
2021

Next tag badge

complexity-classes

28/100 score

5/20 answers

Badges

14

23

Newest

Revival

Next badge

0/1

Impact

2 posts edited

1 helpful flag

327 votes cast

4 Questions

Votes Activity Newest Views

11

votes

1

answer

150

views

Literature about a naive approach to graph isomorphism by inspecting polynomials of adjacency matrices

reference-request graph-isomorphism

Nov 10 '16 at 23:53 Thomas Klimpel 5,266

3

5

votes

2

answers

652

views

There are parsimonious reductions between all NP-Complete problems: Well-known conjecture?

complexity-theory reference-request np-complete

Sep 19 '18 at 10:21 Thinh D. Nguyen 2,195

1

3

votes

1

answer

201

views

IS $LOGSPACE\subsetneq QMA$ an open problem?

complexity-classes quantum-computing

Sep 8 '18 at 11:43 Community♦ 1

1

vote

0

answers

231

views

Misunderstanding the Baker-Gill-Solovay oracle and obtaining $LOGSPACE^A=PSPACE^A$

complexity-theory complexity-classes space-complexity oracle-machines relativization

Feb 25 '17 at 22:11 Lieuwe Vinkhuijzen 4,156

Computer Science Stack Exchange works best with JavaScript enabled