ACM Symposium on Discrete Algorithms, SODA 2014


Article Details
Title: Parameters of Two-Prover-One-Round Game and The Hardness of Connectivity Problems
Article URLs:
Alternative Article URLs:
Authors: Bundit Laekhanukit
  • McGill University, Montreal, QC, Canada, School of Computer Science
Sharing: Unknown
Verification: Author has not verified information
Artifact Evaluation Badge: none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key: conf/soda/Laekhanukit14
Author Comments:

Discuss this paper and its artifacts below