9 citations · 9 across the 1 of their papers we have counts for
2 papers
cs.DS2008
The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous Logspace
Thomas Thierauf, Fabian Wagner
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithms…
quant-ph2007★ 9 cited
The Quantum Query Complexity of Algebraic Properties
Sebastian Doern, Thomas Thierauf
We present quantum query complexity bounds for testing algebraic properties. For a set S and a binary operation on S, we consider the decision problem whether is a semigroup or…