David Défossez

Computational Theory and Mathematics · 2009

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

Subfields

Whom David Défossez trusts overall

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

  1. David S. Johnson

Papers from David Défossez's perspective

Ordered by how strongly the researchers David Défossez trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The NP-Completeness Column: An Ongoing Guide
  2. List colourings of planar graphs (Discrete Mathematics)
  3. The Complexity of Computing the Permanent
  4. A personal communication
  5. HOW GOOD IS THE SIMPLEX ALGORITHM
  6. A and V
  7. On the computational complexity of Ising spin glass models
  8. A dynamic programming approach to sequencing problems
  9. A Note on the Graph Isomorphism counting Problem
  10. A machine program for theorem-proving (CACM)

Their papers