GENERIC COMPLEXITY OF FIRST-ORDER THEORIES

被引：0
|
作者：
Rybalov, A. N. [1 ]
机构：
[1] Russian Acad Sci, Siberian Branch, Omsk Branch, Inst Math, Pevtsova Str 13, Omsk 644043, Russia
来源：
SIBERIAN ELECTRONIC MATHEMATICAL REPORTS-SIBIRSKIE ELEKTRONNYE MATEMATICHESKIE IZVESTIYA | 2011年 / 8卷
关键词：
generic complexity; first order theory;
D O I：
暂无
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Theory of generic complexity studies algorithmical problems for "almost all" inputs. A problem can be hard or undecidable in the worst case but feasible in the generic case. In this review we describe some recent results about generic complexity of the following first order theories: any undecidable first order theory (Mysnikov, Rybalov), ordered field of real numbers (Rybalov, Fedosov), Presburger arithmetic (Rybalov).
引用
收藏
页码：168 / 178
页数：11
相关论文
共 50 条
12345