| 2007 |
|---|
| 13 | EE | Manindra Agrawal,
Thanh Minh Hoang,
Thomas Thierauf:
The Polynomially Bounded Perfect Matching Problem Is in NC 2.
STACS 2007: 489-499 |
| 2006 |
|---|
| 12 | EE | Thanh Minh Hoang,
Meena Mahajan,
Thomas Thierauf:
On the Bipartite Unique Perfect Matching Problem.
ICALP (1) 2006: 453-464 |
| 11 | EE | Manindra Agrawal,
Thanh Minh Hoang,
Thomas Thierauf:
The polynomially bounded perfect matching problem is in NC^2.
Electronic Colloquium on Computational Complexity (ECCC) 13(129): (2006) |
| 2005 |
|---|
| 10 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Inertia and Some Closure Properties of GapL.
IEEE Conference on Computational Complexity 2005: 28-37 |
| 2004 |
|---|
| 9 | EE | Thomas Thierauf,
Thanh Minh Hoang:
On Closure Properties of GapL
Electronic Colloquium on Computational Complexity (ECCC)(024): (2004) |
| 8 | EE | Thanh Minh Hoang,
Thomas Thierauf:
On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci. 15(1): 89-105 (2004) |
| 7 | EE | Thanh Minh Hoang,
Thomas Thierauf:
Erratum: On The Minimal Polynomial Of A Matrix.
Int. J. Found. Comput. Sci. 15(4): 685 (2004) |
| 2003 |
|---|
| 6 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The complexity of the characteristic and the minimal polynomial.
Theor. Comput. Sci. 295: 205-222 (2003) |
| 2002 |
|---|
| 5 | EE | Thanh Minh Hoang,
Thomas Thierauf:
On the Minimal Polynomial of a Matrix.
COCOON 2002: 37-46 |
| 4 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Inertia.
FSTTCS 2002: 206-217 |
| 2001 |
|---|
| 3 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Minimal Polynomial.
MFCS 2001: 408-420 |
| 2 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of the Minimal Polynomial
Electronic Colloquium on Computational Complexity (ECCC) 8(28): (2001) |
| 2000 |
|---|
| 1 | EE | Thanh Minh Hoang,
Thomas Thierauf:
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity.
IEEE Conference on Computational Complexity 2000: 87- |
