Advertisement

Some Graph-Based Formulas

  • Ilario Bonacina
Chapter

Abstract

We now show some further applications of the general theorems to prove space lower bounds from Chap. 3 and Chap. 4. That is we see how to prove monomial and resolution total space lower bounds for random k-CNF formulas (Sect. 7.2), the pigeonhole principle over a bipartite graph (Sect. 7.3) and Tseitin formulas (Sect. 7.4).

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing AG 2017

Authors and Affiliations

  1. 1.Departament de Ciències de la ComputacióUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations