Haken's seminar

Article View: ut.theory

Article #314

#314

From: Stephen Cook
Date: Mon, 13 Feb 1989 19:55

5 lines
588 bytes

Armin Haken's talk Thursday should be billed as a join Theory-AI seminar
(instead of just AI).  He will prove a hard lower bound result which is
definitely of interest to complexity theorists. His talk is
 
                 Thrus., Feb 16, 11 am in SF 1105

Technical Details

Message-ID: <89Feb13.145603est.38108@neat.ai.toronto.edu>

Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root

Show Full Headers

Complete Article Headers

Newsgroups: ut.theory
Path: arc1-ca.pugleaf.net!utzoo!utgpu!jarvis.csri.toronto.edu!neat.ai.toronto.edu!root
From: sacook@ai.toronto.edu (Stephen Cook)
Subject: Haken's seminar
Message-ID: <89Feb13.145603est.38108@neat.ai.toronto.edu>
Organization: Department of Computer Science, University of Toronto
Date: Mon, 13 Feb 89 14:55:51 EST