Thanh Minh Hoang

17 papers A 4B 1Misc 1Journal 9Unranked 2
YearRankTypeTitle / Venue / Authors
2010 J jnl
Isolation of Matchings via Chinese Remaindering.
Electron. Colloquium Comput. Complex.
Thanh Minh Hoang
2010 A conf
On the Matching Problem for Special Graph Classes.
CCC
Thanh Minh Hoang
2010 J jnl
The Complexity of the Inertia.
Comput. Complex.
Thanh Minh Hoang, Thomas Thierauf
2009 J jnl
On the Matching Problem for Special Graph Classes.
Electron. Colloquium Comput. Complex.
Thanh Minh Hoang
2007 A conf
The Polynomially Bounded Perfect Matching Problem Is in NC
STACS
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
2006 — conf
On the Bipartite Unique Perfect Matching Problem.
ICALP (1)
Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf
2006 J jnl
The polynomially bounded perfect matching problem is in NC^2.
Electron. Colloquium Comput. Complex.
Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf
2005 A conf
The Complexity of the Inertia and Some Closure Properties of GapL.
CCC
Thanh Minh Hoang, Thomas Thierauf
2004 J jnl
Erratum: On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci.
Thanh Minh Hoang, Thomas Thierauf
2004 J jnl
On Closure Properties of GapL
Electron. Colloquium Comput. Complex.
Thomas Thierauf, Thanh Minh Hoang
2004 J jnl
On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci.
Thanh Minh Hoang, Thomas Thierauf
2003 J jnl
The complexity of the characteristic and the minimal polynomial.
Theor. Comput. Sci.
Thanh Minh Hoang, Thomas Thierauf
2002 Misc conf
On the Minimal Polynomial of a Matrix.
COCOON
Thanh Minh Hoang, Thomas Thierauf
2002 — conf
The Complexity of the Inertia.
FSTTCS
Thanh Minh Hoang, Thomas Thierauf
2001 J jnl
The Complexity of the Minimal Polynomial
Electron. Colloquium Comput. Complex.
Thanh Minh Hoang, Thomas Thierauf
2001 B conf
The Complexity of the Minimal Polynomial.
MFCS
Thanh Minh Hoang, Thomas Thierauf
2000 A conf
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
CCC
Thanh Minh Hoang, Thomas Thierauf