Остановите войну!
for scientists:
default search action
Thanh Minh Hoang
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2010
- [j4]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Inertia. Comput. Complex. 19(4): 559-580 (2010) - [c8]Thanh Minh Hoang:
On the Matching Problem for Special Graph Classes. CCC 2010: 139-150 - [i5]Thanh Minh Hoang:
Isolation of Matchings via Chinese Remaindering. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [i4]Thanh Minh Hoang:
On the Matching Problem for Special Graph Classes. Electron. Colloquium Comput. Complex. TR09 (2009) - 2007
- [c7]Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf:
The Polynomially Bounded Perfect Matching Problem Is in NC 2. STACS 2007: 489-499 - 2006
- [c6]Thanh Minh Hoang, Meena Mahajan, Thomas Thierauf:
On the Bipartite Unique Perfect Matching Problem. ICALP (1) 2006: 453-464 - [i3]Manindra Agrawal, Thanh Minh Hoang, Thomas Thierauf:
The polynomially bounded perfect matching problem is in NC^2. Electron. Colloquium Comput. Complex. TR06 (2006) - 2005
- [c5]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Inertia and Some Closure Properties of GapL. CCC 2005: 28-37 - 2004
- [j3]Thanh Minh Hoang, Thomas Thierauf:
On The Minimal Polynomial Of A Matrix. Int. J. Found. Comput. Sci. 15(1): 89-105 (2004) - [j2]Thanh Minh Hoang, Thomas Thierauf:
Erratum: On The Minimal Polynomial Of A Matrix. Int. J. Found. Comput. Sci. 15(4): 685 (2004) - [i2]Thomas Thierauf, Thanh Minh Hoang:
On Closure Properties of GapL. Electron. Colloquium Comput. Complex. TR04 (2004) - 2003
- [j1]Thanh Minh Hoang, Thomas Thierauf:
The complexity of the characteristic and the minimal polynomial. Theor. Comput. Sci. 295: 205-222 (2003) - 2002
- [c4]Thanh Minh Hoang, Thomas Thierauf:
On the Minimal Polynomial of a Matrix. COCOON 2002: 37-46 - [c3]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Inertia. FSTTCS 2002: 206-217 - 2001
- [c2]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Minimal Polynomial. MFCS 2001: 408-420 - [i1]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of the Minimal Polynomial. Electron. Colloquium Comput. Complex. TR01 (2001) - 2000
- [c1]Thanh Minh Hoang, Thomas Thierauf:
The Complexity of Verifying the Characteristic Polynomial and Testing Similarity. CCC 2000: 87-
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:52 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint