And from thir Ivorie Port the Cherubim Forth issuing at th’accustomd hour stood armd To thir night watches in warlike Parade, When Gabriel to his next in power thus spake...

One can ask if for any algebra the considered problem is always in P or NP-complete (P or coNP-complete)? For example, the problem of the satisfiability of a system of polynomial equations over a group G is in P if G is abelian and NP-complete otherwise ([7, 13]). One of the most widely known subclasses of NP which exhibits such a dichotomy, is the class of constraint satisfaction problems (CSP) on the set {0,1}, see [16]. Recently Bulatov proved the dichotomy for CSP on a three-element set [3].

My foreign exchange applet knows the currency codes for all officially recognized currencies, not just USD and GBP.

We got a good hatching from the swallowtail eggs.