Concepedia

Armin Haken

AH

4

Publications

979

Citations

4

H-Index

1985

Active since

Affiliations

University of Toronto(Current)

Armin Haken is an author at University of Toronto specializing in computational complexity, engineering, and discrete mathematics.

Top concepts

EngineeringComputational ComplexityCircuit ComplexityDiscrete MathematicsCommunication ComplexityGraph TheoryFormal MethodsComputer ScienceAutomated ReasoningComputer Engineering

Publications per year

1985–2002

4

Publications

4

The intractability of resolution

Armin Haken · Theoretical Computer Science · 1985 · 818 citations

Computational Complexity Theory, Engineering, Automated Reasoning +4

An Exponential Lower Bound for the Size of Monotone Real Circuits

Armin Haken, Stephen Cook · Journal of Computer and System Sciences · 1999 · 78 citations

Circuit Complexity, Engineering, Lower Bound +5

Counting bottlenecks to show monotone P≠NP

Armin Haken · 2002 · 62 citations

Circuit Complexity, Computational Complexity Theory, Engineering +16

Steepest Descent Can Take Ex ponentia l T im e for Symmetric Connection Networks

Armin Haken, Michael Luby · Complex Systems · 1988 · 21 citations

Rows per page

1–4 of 4