I have a cold and can’t sleep, and hence a google search revealed this post. My grandfather is a doctor, and always said you could double or triple any OTC meds except aceteminophen. It’s a very effective suicide drug. And my guess is that some people are very sensitive to even a double dosage of it…. I’m glad you didn’t take any more of it than you did!

Uggggh, I can’t sleep.

Beth

]]>Then description of some complexity classes can be enriched by “A compendium of problems complete for X is”

I believe it would be really useful. For some classes, like $FP^NP(log n)$ it really takes time to read many articles to find a “good” complete problem which suits your needs. Everybody knows about Garey and Johnson book or the Viggo’s compendium, but to prove FP^NP(log n) hardness people read Krentel, Papadimimitrou, etc articles

I any case you list Gerey and Johnson and Viggo’s compendia as “Other Theory Compendia” at Complexity Zoo Introduction page. ]]>

Also known as colloquially as “itchy scratchy”, pseudoephedrine is quite popular as an illicit stimulant, although its effectiveness as such is somewhat dubious.

]]>Probably. That gives a reason why you don’t see it in the US, just like cricket, rugby and colour (were) morphed into baseball, American football and color ðŸ˜‰

]]>(closes eyes, crosses legs)

Ohhhhmmmmmmmmmm

OK, was that good?

I prefer Tai-Chi ðŸ™‚

]]>I am very sorry for a comment which is not related to your post but I hope information provided is useful for you.

In a “Complexity Zoo Introduction” part of your the Complexity Zoo, you references compendia of complexity classes.

The list is not complete

Fixed-Parameter Tractability and Completeness I: Basic Results, Rod G. Downey and Michael R. Fellows, SIAM. J. COMPUTING, Vol. 24, No. 4., pp. 873-921 (August 1997) contains a compendium of **fixed-parameter problems**. (between 150 and 200 problems)

Of course, all these problems are in Downey, Fellows books, but I believe it is easer to get an article then a book (the Downey, Fellows book is very expensive).

Completeness in the Polynomial-Time Hierarchy: A Compendium

Marcus Schaefer, Chris Umans; Sigact News, September 2002.

Completeness in the Polynomial-Time Hierarchy: Part II, Marcus Schaefer, Chris Umans, Sigact News, December 2002.

is a compendium of problems for **Polynomial-Time Hierarchy**. This compendium is very comprehensive and contains almost all rpoblems prooved to be hatd for some of Delta, Pi, Sigma classes.