Inductive Time-Space Lower Bounds for Sat and Related Problems

We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.

• Type: Journal
• Year: 2006
• Where: CC
• Authors: Ryan Williams
• Keywords: CC 2006, Explicit Problems, Indirect Diagonalization Arguments, Lower Bounds, System Software