The following pages link to Thomas Thierauf (Q503454):
Displaying 9 items.
- The Complexity of Poset Games (Q5084701) (← links)
- Factorization of polynomials given by arithmetic branching programs (Q5092484) (← links)
- Reductions to sets of low information content (Q5204315) (← links)
- Bipartite perfect matching is in quasi-NC (Q5361877) (← links)
- The Quantum Query Complexity of Algebraic Properties (Q5444965) (← links)
- The Quantum Complexity of Group Testing (Q5448677) (← links)
- ON THE MINIMAL POLYNOMIAL OF A MATRIX (Q5696967) (← links)
- Isolating a Vertex via Lattices: Polytopes with Totally Unimodular Faces (Q5858649) (← links)
- The satisfiability problem for probabilistic ordered branching programs (Q5956791) (← links)