Complexity of finitely presented algebras
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Space bounds for a game on graphs
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
The complexity of resolution procedures for theorem proving in the propositional calculus.
The complexity of resolution procedures for theorem proving in the propositional calculus.
The intractability of resolution (complexity)
The intractability of resolution (complexity)
| Hi-index | 0.00 |
A lower bound of &Ohgr;(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].