R. Downey

Computational Theory and Mathematics · 2008–2015

A researcher in the Science corpus: 3 papers; trusts 3 researchers and is trusted by 0 researchers here, as inferred from the citation graph.

Subfields

• Computational Theory and Mathematics — 5 citations into it

Whom R. Downey trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

1. Jiong Guo
2. Lance Fortnow

Papers from R. Downey's perspective

Ordered by how strongly the researchers R. Downey trusts endorse each paper. Same corpus, a different order for every researcher.

1. Parameterized Complexity Theory
2. The complexity of theorem-proving procedures
3. Invitation to data reduction and problem kernelization (SIGA)
4. Infeasibility of instance compression and succinct PCPs for NP (Journal of computer and system sciences (Print))
5. Invitation to fixed-parameter algorithms (Computer Science Review)
6. Solving Real-World Linear Programs: A Decade and More of Progress (Operational Research)
7. Parameterized Complexity and Approximation Algorithms (Computer/law journal)
8. Multi-prover interactive proofs: how to remove intractability assumptions
9. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
10. PRIMES is in P

Their papers

• On problems without polynomial kernels (2009) — 537 citations
• The complexity of computable categoricity (2015) — 49 citations
• THE ISOMORPHISM PROBLEM FOR TORSION-FREE ABELIAN GROUPS IS ANALYTIC COMPLETE. (2008) — 70 citations