Thanh Minh Hoang

According to our database, Thanh Minh Hoang authored at least 13 papers between 2000 and 2010.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2010

Isolation of Matchings via Chinese Remaindering.

Thanh Minh Hoang

Electron. Colloquium Comput. Complex., 2010

On the Matching Problem for Special Graph Classes.

Thanh Minh Hoang

Proceedings of the 25th Annual IEEE Conference on Computational Complexity, 2010

2007

The Polynomially Bounded Perfect Matching Problem Is in NC ².

Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf

Proceedings of the STACS 2007, 2007

2006

The polynomially bounded perfect matching problem is in NC^2.

Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf

Electron. Colloquium Comput. Complex., 2006

On the Bipartite Unique Perfect Matching Problem.

Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf

Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005

The Complexity of the Inertia and Some Closure Properties of GapL.

Thanh Minh Hoang, Thomas Thierauf

Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004

Erratum: On The Minimal Polynomial Of A Matrix.

Thanh Minh Hoang, Thomas Thierauf

Int. J. Found. Comput. Sci., 2004

On Closure Properties of GapL

Thomas Thierauf, Thanh Minh Hoang

Electron. Colloquium Comput. Complex., 2004

2003

The complexity of the characteristic and the minimal polynomial.

Thanh Minh Hoang, Thomas Thierauf

Theor. Comput. Sci., 2003

2002

The Complexity of the Inertia.

Thanh Minh Hoang, Thomas Thierauf

Proceedings of the FST TCS 2002: Foundations of Software Technology and Theoretical Computer Science, 2002

On the Minimal Polynomial of a Matrix.

Thanh Minh Hoang, Thomas Thierauf

Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

2001

The Complexity of the Minimal Polynomial.

Thanh Minh Hoang, Thomas Thierauf

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

2000

The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.

Thanh Minh Hoang, Thomas Thierauf

Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000