Skip to main content

All Questions

Filter by
Sorted by
Tagged with
15 votes
1 answer
742 views

Computing van Kampen diagrams

If G is a finitely presented group (with generating set X) and w is a word over X such that w=1 in G, then the latter can be witnessed by a so called van Kampen diagram for w, which is a planar ...
Markus Lohrey's user avatar
4 votes
1 answer
166 views

Complementing the red and blue boolean cube?

Given a boolean $0/1$ cube in $n$ dimensions with $2^{n-1}$ red and $2^{n-1}$ blue points can we complement the cube (blue becomes red and vice versa) in $\operatorname{poly}(n)$ transformations? ...
Turbo's user avatar
  • 13.9k
2 votes
0 answers
137 views

Time complexity of randomized algorithm: right-multiplying by random elements $z_i$ from a group $H$ to achieve $H$-invariance

Note: This question was inspired by a related question about the Quantum Merlin Arthur (QMA) complexity class on Quantum Computing Stack Exchange. I was deliberating whether to ask this on CS Theory ...
Sanchayan Dutta's user avatar