Igor C. Oliveira

Learn More
Different techniques have been used to prove several transference theorems of the form " non-trivial algorithms for a circuit class C yield circuit lower bounds against C ". In this survey we revisit many of these results. We discuss how circuit lower bounds can be obtained from deran-domization, compression, learning, and satisfiability algorithms. We also(More)
The graph reconstruction conjecture asserts that a finite simple graph on at least 3 vertices can be reconstructed up to isomorphism from its deck-the collection of its vertex-deleted subgraphs. Kocay's Lemma is an important tool in graph reconstruction. Roughly speaking, given the deck of a graph G and any finite sequence of graphs, it gives a linear(More)
  • 1