Talk:Computational complexity theory

This is an old revision of this page, as edited by LC~enwiki (talk | contribs) at 02:12, 16 January 2002. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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


I'd suggest two places: in P and in EXPTIME, in both cases saying it's outside the set. --LC