![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Phuong Nguyen 0001
Person information
- affiliation (former): University of Toronto, Canada
Other persons with the same name
- Phuong Nguyen — disambiguation page
- Phuong Nguyen 0002 — University of Illinois Urbana-Champaign, USA
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
- [j8]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing small complexity classes and their theories. Comput. Complex. 25(1): 177-215 (2016) - 2015
- [j7]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi
, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Comput. Complex. 24(3): 645-694 (2015) - 2014
- [j6]Alexis Maciel, Phuong Nguyen, Toniann Pitassi:
Lifting lower bounds for tree-like proofs. Comput. Complex. 23(4): 585-636 (2014) - 2012
- [j5]Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. ACM Trans. Comput. Log. 13(1): 9:1-9:24 (2012) - [c6]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi
, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. ICALP (1) 2012: 13-24 - [i4]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and their Theories. CoRR abs/1204.5508 (2012) - 2011
- [j4]Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen:
The provably total NP search problems of weak second order bounded arithmetic. Ann. Pure Appl. Log. 162(6): 419-446 (2011) - [j3]Emil Jerábek
, Phuong Nguyen:
Simulating non-prenex cuts in quantified propositional calculus. Math. Log. Q. 57(5): 524-532 (2011) - [c5]Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos:
Computationally Limited Randomness. ICS 2011: 522-536 - [i3]Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen:
The NOF Multiparty Communication Complexity of Composed Functions. Electron. Colloquium Comput. Complex. TR11 (2011) - 2010
- [i2]Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. CoRR abs/1002.2954 (2010)
2000 – 2009
- 2009
- [j2]Phuong Nguyen:
The equivalence of theories that characterize ALogTime. Arch. Math. Log. 48(6): 523-549 (2009) - 2008
- [b1]Phuong Nguyen:
Bounded reverse mathematics. University of Toronto, Canada, 2008 - [c4]Phuong Nguyen:
Proving Infinitude of Prime Numbers Using Binomial Coefficients. CSL 2008: 184-198 - 2007
- [c3]Klaus Aehlig, Stephen A. Cook, Phuong Nguyen:
Relativizing Small Complexity Classes and Their Theories. CSL 2007: 374-388 - [c2]Phuong Nguyen, Stephen A. Cook:
The Complexity of Proving the Discrete Jordan Curve Theorem. LICS 2007: 245-256 - 2006
- [j1]Phuong Nguyen, Stephen A. Cook:
Theories for TC0 and Other Small Complexity Classes. Log. Methods Comput. Sci. 2(1) (2006) - 2005
- [i1]Phuong Nguyen, Stephen A. Cook:
Theories for TC0 and Other Small Complexity Classes. CoRR abs/cs/0505013 (2005) - 2004
- [c1]Phuong Nguyen, Stephen A. Cook:
VTC circ: A Second-Order Theory for TCcirc. LICS 2004: 378-387
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-08-27 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint