Èíôîðìàöèîííàÿ ñèñòåìà "Êîíôåðåíöèè"


The 9th Asian Logic Conference

16-19 August, 2005
Novosibirsk, Russia

Abstracts

Computability theory

The time complexity of the bounded first-order theory

Latkin I.V.

East Kazakhstan State Technical University named after D.SERIKBAEV (Ust-Kamenogorsk)

Text in rtf-file.

Additional information:

Mail to Webmaster
alc9@math.nsc.ru
|Home Page| |English Part| [SBRAS]
Go to Home
© 1996-2000, Siberian Branch of Russian Academy of Sciences, Novosibirsk
    Last update: 06-Jul-2012 (11:44:52)