Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Hoang, Thanh Minh - Institut für Theoretische Informatik, Universität Ulm
Universitat Ulm Abteilung Theoretische Informatik
International Journal of Foundations of Computer Science World Scienti c Publishing Company
The Complexity of the Characteristic and the Minimal Polynomial ?
The polynomially bounded perfect matching problem is in NC 2#
The Complexity of the Inertia Closure Properties of GapL #
The Complexity of the Inertia ? Thanh Minh Hoang 1 and Thomas Thierauf 2; ??
The Complexity of the Minimal Polynomial ? Thanh Minh Hoang and Thomas Thierauf
On Closure Properties of GapL Thanh Minh Hoang
On the Minimal Polynomial of a Matrix ? Thanh Minh Hoang and Thomas Thierauf
On the Bipartite Unique Perfect Matching Problem
