An Eulerian circuit in a directed graph is one of the most fundamental Graph Theory notions. Detecting if G has unique can be done polynomial time via BEST theorem by de Bruijn, van Aardenne-Ehrenfest, Smith and Tutte (1941–1951) [15], [16] (involving counting arborescences), or tailored characterization Pevzner, 1989 computing intersection simple cycles G), both which thus rely on overly compl...

Firstly, in this paper, we prove that the equivalence of simplicity and the symmetry of forking. Secondly, we attempt to recover deenability part of stability theory to simplicity theory. In particular, using elimination of hyperimaginaries we prove that for any supersimple T , canonical base of an amalgamation class P is the union of names of-deenitions of P, ranging over stationary L-formulas...

The relation between classes of languages recognized by resource bounded Turing machines remains an evasive subject in computational complexity theory. Especially results settling relationship between deterministic and nondeterministic complexity classes are rare. The interesting case of the relation between the classes of languages recognized by polynomial time bounded deterministic versus pol...

introduction: prevention and control of cross infections for the personnel of dental offices and clinics are a critical issue in dental practice. in this study, a standardized questionnaire was developed to assess the knowledge, attitude and practice of the oral health-care workers in tehran university dental school regarding the blood-transmitted diseases and its validity and reliability were ...