 | 
| |
Online DBLP entries are available for Sergei G. Vorobyov and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)
-
Sergei G. Vorobyov: forall exists*-Equational Theory of Context Unification
is Pi10-Hard.
MFCS
1998: 597-606
-
Sergei G. Vorobyov,
Andrei
Voronkov: Complexity of Nonrecursive Logic Programs with Complex Values.
PODS
1998: 244-253
-
Sergei G. Vorobyov: The "Hardest" Natural Decidable Theory.
LICS
1997: 294-305
-
Sergei G. Vorobyov: The First-Order Theory of One Step Rewriting in Linear
Noetherian Systems is Undecidable.
RTA
1997: 254-268
-
Sergei G. Vorobyov: On the Bounded Theories of Finite Frees.
ASIAN
1996: 152-161
-
Sergei G. Vorobyov: An Improved Lower Bound for the Elementary Theories
of Trees.
CADE
1996: 275-287
-
Sergei G. Vorobyov: Structural Decidable Extensions of Bounded Quantification.
POPL
1995: 164-175
-
Sergei G. Vorobyov: On the Arithmetic Inexpressiveness of Term Rewriting
Systems.
LICS
1988: 212-217
DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).
|
|
