We present algebraic conditions on constraint languages Γ that ensure the hardness of the constraint satisfaction problem CSP(Γ) for complexity classes L, NL, P, NP and ModpL. Th...
Case attraction has stood as a puzzling, and elusive, oddity of older Indo-European languages. This paper focuses on attraction in Ancient Greek, establishing both the regularity o...
Unless you have a complete and precise description of your product’s requirements, it is very unlikely that you will satisfy those requirements. A requirements document that is ...
Chi calculus was proposed as a process algebra that has a uniform treatment of names. The paper carries out a systematic study of bisimilarities for chi processes. The notion of L-...
A probabilistically checkable debate system (PCDS) for a language L consists of a probabilisticpolynomial-time veri er V and a debate between Player 1, who claims that the input x ...
Anne Condon, Joan Feigenbaum, Carsten Lund, Peter ...