The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. - Thanh Minh Hoang; Thomas Thierauf (CCC, 2000)

The Complexity of the Minimal Polynomial - Thanh Minh Hoang; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2001)

The complexity of the characteristic and the minimal polynomial. - Thanh Minh Hoang; Thomas Thierauf (Theor. Comput. Sci., 2003)

On Closure Properties of GapL - Thomas Thierauf; Thanh Minh Hoang (Electron. Colloquium Comput. Complex., 2004)

On The Minimal Polynomial Of A Matrix. - Thanh Minh Hoang; Thomas Thierauf (Int. J. Found. Comput. Sci., 2004)

Erratum: On The Minimal Polynomial Of A Matrix. - Thanh Minh Hoang; Thomas Thierauf (Int. J. Found. Comput. Sci., 2004)

The Complexity of the Inertia and Some Closure Properties of GapL. - Thanh Minh Hoang; Thomas Thierauf (CCC, 2005)

On the Bipartite Unique Perfect Matching Problem. - Thanh Minh Hoang; Meena Mahajan; Thomas Thierauf (ICALP (1), 2006)

The polynomially bounded perfect matching problem is in NC^2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (Electron. Colloquium Comput. Complex., 2006)

The Polynomially Bounded Perfect Matching Problem Is in NC 2. - Manindra Agrawal; Thanh Minh Hoang; Thomas Thierauf (STACS, 2007)

On the Matching Problem for Special Graph Classes. - Thanh Minh Hoang (Electron. Colloquium Comput. Complex., 2009)

The Complexity of the Inertia. - Thanh Minh Hoang; Thomas Thierauf (Comput. Complex., 2010)

Isolation of Matchings via Chinese Remaindering. - Thanh Minh Hoang (Electron. Colloquium Comput. Complex., 2010)