Profile Activity

Lieuwe Vinkhuijzen

Network profile

Reputation

3,852

3.9k
2.2k
571

2016
2017
2018
2019

Next tag badge

complexity-classes

28/100 score

5/20 answers

Badges

12

21

Newest

Yearling

Next badge

0/1

Impact

1 post edited

1 helpful flag

282 votes cast

Summary Answers Questions Tags Badges Favorites Bounties Reputation All actions

4 Questions

Views Newest Activity Votes

10

votes

1

answer

105

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,005

3

5

votes

2

answers

315

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,122

1

3

votes

1

answer

164

views

IS $LOGSPACE\subsetneq QMA$ an open problem?

complexity-classes quantum-computing

Sep 8 '18 at 11:43 Community♦ 1

1

vote

0

answers

203

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 3,852

Computer Science Stack Exchange works best with JavaScript enabled