We consider a compressed form of the word problem for finitely presented monoids, where
the input consists of two compressed representations of words over the generators of a …

Graph isomorphism (GI) is one of the few remaining problems in NP whose complexity
status couldn't be solved by classifying it as being either NP-complete or solvable in P …

We a give an intrinsic characterization of the class of functions which are computable in NC
1 that is by a uniform, logarithmic depth and polynomial size family circuit. Recall that the …

In this paper we analyze some intrusion detection strategies proposed in the literature and
we show that they represent the various facets of a well known formal languages problem …

Die Komplexitätstheorie beschäftigt sich mit der Abschätzung des Aufwandes, welcher zur
Lösung algorithmischer Probleme nötig ist. In diesem Aufsatz verfolgen wir die spannende …

Einige bedeutende Klassen von Graphen besitzen eine Anzahl von Cliquen, die polynomiell
mit der Anzahl der Knoten im Graphen verknüpft ist. Ein Beispiel hierfür sind …

We a give an intrinsic characterization of the class of functions which are computable in
$\NCUN $ that is by a uniform, logarithmic depth and polynomial size family circuit. Recall …

Щй ви в гбдйи ж ж и в б и в б во в й в Ш ж б И з й ж Щй в и вб в жй иИ з ж зд вв в в йв ой а
д ж гм в ж в йв ж Ш н з з ОМК Т ж йв жизК з ж з в в жж з в о ви Щй ви в а гж и б в ж Шжг а б …

In this article we chronologically survey the closure under complementation results for
several logspace-bounded complexity classes, namely the early collapses of the logspace …