Grigni : [ 2 b ] Monotone Separation of Logarithmic Space from Logarithmic Depth


In recent years there have been several strong results in monotone complexity theory. Razborov's theorem [10] showing that the clique function requires superpolynomial size monotone circuits solved a long-standing open question. More recently the result of Karchmer and Wigderson [7] showed that the st-connectivity function requires superlogarithmic depth… (More)

3 Figures and Tables


  • Presentations referencing similar topics