Armin Haken

Steepest Descent Can Take Exponential Time for Symmetric Connection Networks

Michael Luby, Armin Haken, M. Luby, 1988, Complex Syst..

An Exponential Lower Bound for the Size of Monotone Real Circuits

Stephen A. Cook, Armin Haken, S. Cook, 1999, J. Comput. Syst. Sci..

The Intractability of Resolution

Armin Haken, Armin Haken, 1985, Theor. Comput. Sci..

Counting bottlenecks to show monotone P/spl ne/NP

Armin Haken, Armin Haken, 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.