Thanh Minh Hoang

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

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2010
Isolation of Matchings via Chinese Remaindering.
Electron. Colloquium Comput. Complex., 2010

The Complexity of the Inertia.
Comput. Complex., 2010

2009
On the Matching Problem for Special Graph Classes.
Electron. Colloquium Comput. Complex., 2009

2007
The Polynomially Bounded Perfect Matching Problem Is in NC <sup>2</sup>.
Proceedings of the STACS 2007, 2007

2006
The polynomially bounded perfect matching problem is in NC^2.
Electron. Colloquium Comput. Complex., 2006

On the Bipartite Unique Perfect Matching Problem.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

2005
The Complexity of the Inertia and Some Closure Properties of GapL.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005

2004
Erratum: On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci., 2004

On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci., 2004

On Closure Properties of GapL
Electron. Colloquium Comput. Complex., 2004

2003
The complexity of the characteristic and the minimal polynomial.
Theor. Comput. Sci., 2003

2001
The Complexity of the Minimal Polynomial
Electron. Colloquium Comput. Complex., 2001

2000
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
Proceedings of the 15th Annual IEEE Conference on Computational Complexity, 2000


  Loading...