Publication
STOC 1984
Conference paper

Pebblings, edgings, and equational logic

View publication

Abstract

A lower bound of ?(n/logn) space is shown for two natural proof systems for equational logic. The method introduces an edging game, a generalization of the pebble game [P].

Date

01 Dec 1984

Publication

STOC 1984

Authors

Share