10 citations · 12 across the 2 of their papers we have counts for
2 papers
cs.CC2011★ 2 cited
Barbosa, Uniform Polynomial Time Bounds, and Promises
Lane A. Hemaspaandra, Kyle Murray, Xiaoqing Tang
This note is a commentary on, and critique of, Andre Luiz Barbosa's paper entitled "P != NP Proof." Despite its provocative title, what the paper is seeking to do is not to prove P…
cs.LG2011★ 10 cited
Algorithmic Programming Language Identification
David Klein, Kyle Murray, Simon Weber
Motivated by the amount of code that goes unidentified on the web, we introduce a practical method for algorithmically identifying the programming language of source code. Our work…