Talk:Computational complexity theory

This is an old revision of this page, as edited by AxelBoldt (talk | contribs) at 21:10, 15 January 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

I wonder where would be a good place to mention that we know some problems not in P, for instance Presburger arithmetic. --AxelBoldt