Sciweavers

CSL
2005
Springer
13 years 10 months ago
A Propositional Proof System for Log Space
The proof system G∗ 0 of the quantified propositional calculus corresponds to NC1 , and G∗ 1 corresponds to P, but no formula-based proof system that corresponds log space rea...
Steven Perron
ISAAC
2007
Springer
108views Algorithms» more  ISAAC 2007»
13 years 11 months ago
Checking Value-Sensitive Data Structures in Sublinear Space
Checking value-sensitive data structures in sublinear space has been an open problem for over a decade. In this paper, we suggest a novel approach to solving it. We show that, in c...
Michael T. Goodrich, Jonathan Z. Sun