COUNTING IN BOUNDED ARITHMETIC AND RELATED PROBLEMS

被引：0

|

作者：

PARIS, J

机构：

来源：

JOURNAL OF SYMBOLIC LOGIC | 1984年 / 49卷 / 04期

关键词：

D O I：

暂无

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

引用

收藏

页码：1437 / 1437

页数：1

相关论文

共 50 条

[21] Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
Chan, Timothy M.
Patrascu, Mihai
PROCEEDINGS OF THE TWENTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2010, 135 : 161 - +
[22] BOUNDED ARITHMETIC HIERARCHY
HARROW, K
INFORMATION AND CONTROL, 1978, 36 (01): : 102 - 117
[23] A NOTE ON BOUNDED ARITHMETIC
PUDLAK, P
FUNDAMENTA MATHEMATICAE, 1990, 136 (02) : 85 - 89
[24] Counting arithmetic formulas
Gnang, Edinah K.
Radziwill, Maksym
Sanna, Carlo
EUROPEAN JOURNAL OF COMBINATORICS, 2015, 47 : 40 - 53
[25] On the de-randomization of space-bounded approximate counting problems
Doron, Dean
Ta-Shma, Amnon
INFORMATION PROCESSING LETTERS, 2015, 115 (10) : 750 - 753
[26] On the Complexity of Some State-Counting Problems for Bounded Petri Nets
Reveliotis, Spyros
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 2015, 60 (01) : 205 - 210
[27] On Interpretations of Bounded Arithmetic and Bounded Set Theory
Pettigrew, Richard
NOTRE DAME JOURNAL OF FORMAL LOGIC, 2009, 50 (02) : 141 - 151
[28] FRAGMENTS OF BOUNDED ARITHMETIC AND BOUNDED QUERY CLASSES
KRAJICEK, J
TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY, 1993, 338 (02) : 587 - 598
[29] Higher complexity search problems for bounded arithmetic and a formalized no-gap theorem
Neil Thapen
Archive for Mathematical Logic, 2011, 50 : 665 - 680
[30] The provably total NP search problems of weak second order bounded arithmetic
Kolodziejczyk, Leszek Aleksander
Nguyen, Phuong
Thapen, Neil
ANNALS OF PURE AND APPLIED LOGIC, 2011, 162 (06) : 419 - 446

← 1 2 3 4 5 →