]tBiĽl d;f1P~6 %RF:K[w8%@fl#!~K#K>As[{Gc^l4 Z6PͯӝW {f*=8h+mf76cS/黾Wkl8'f_{>' '=t]L_%o[. ۞*ohWVe;=dЊΊ=W,fVSKFf>5k{h^@&6 @vOT8) iXT(N*Dud#W;L>*UoKd+7XX,X<!k?Ry &7QdmbXe JR a dln; Ts i?~*6;1/"?7?#=,0Ծ-, '. I+ V1Sp^9Ik1@cy ahͭNgwe give complexity results for satisfiability of several hybrid and hybrid temporal languages in the complexity classes EXPTIME, 2EXPTIME, "nonelementarily decidable", and coRE. The presented work is a joint work by Martin Mundhenk, Thomas Schneider, Thomas Schwentick, and Volker Weber. The first two authors are from the University of Jena, Germany. The last two authors are from the University of Dortmund, Germany. A full version of the paper is available at http://www.minet.uni-jena.de/~thschnei/publ/