Phuong Nguyen

According to our database, Phuong Nguyen authored at least 12 papers between 2004 and 2016.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2016

Relativizing small complexity classes and their theories.

Klaus Aehlig, Stephen A. Cook, Phuong Nguyen

Comput. Complex., 2016

2015

The NOF Multiparty Communication Complexity of Composed Functions.

Anil Ada, Arkadev Chattopadhyay, Omar Fawzi, Phuong Nguyen

Comput. Complex., 2015

2014

Lifting lower bounds for tree-like proofs.

Alexis Maciel, Phuong Nguyen, Toniann Pitassi

Comput. Complex., 2014

2012

The Complexity of Proving the Discrete Jordan Curve Theorem.

Phuong Nguyen, Stephen A. Cook

ACM Trans. Comput. Log., 2012

2011

Simulating non-prenex cuts in quantified propositional calculus.

Emil Jerábek, Phuong Nguyen

Math. Log. Q., 2011

The provably total NP search problems of weak second order bounded arithmetic.

Leszek Aleksander Kolodziejczyk, Phuong Nguyen, Neil Thapen

Ann. Pure Appl. Log., 2011

Computationally Limited Randomness.

Matei David, Phuong Nguyen, Periklis A. Papakonstantinou, Anastasios Sidiropoulos

Proceedings of the Innovations in Computer Science, 2011

2009

The equivalence of theories that characterize ALogTime.

Phuong Nguyen

Arch. Math. Log., 2009

2008

Bounded reverse mathematics.

Phuong Nguyen

PhD thesis, 2008

Proving Infinitude of Prime Numbers Using Binomial Coefficients.

Phuong Nguyen

Proceedings of the Computer Science Logic, 22nd International Workshop, 2008

2006

Theories for TC0 and Other Small Complexity Classes.

Phuong Nguyen, Stephen A. Cook

Log. Methods Comput. Sci., 2006

2004

VTC ^circ: A Second-Order Theory for TC^circ.

Phuong Nguyen, Stephen A. Cook

Proceedings of the 19th IEEE Symposium on Logic in Computer Science (LICS 2004), 2004