THE COMPLEXITY OF COMBINATORIAL PROBLEMS WITH SUCCINCT INPUT REPRESENTATION

被引：188

|

作者：

WAGNER, KW

机构：

来源：

ACTA INFORMATICA | 1986年 / 23卷 / 03期

关键词：

D O I：

10.1007/BF00289117

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

收藏

页码：325 / 356

页数：32

相关论文

共 50 条

[41] COMPLEXITY OF A CLASS OF NONLINEAR COMBINATORIAL PROBLEMS RELATED TO THEIR LINEAR COUNTERPARTS
SETHI, SP
KUBIAK, W
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1994, 73 (03) : 569 - 576
[42] The complexity of combinatorial optimization problems on d-dimensional boxes
Chlebik, Miroslav
Chlebikova, Janka
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2007, 21 (01) : 158 - 169
[43] BOUNDS OF THE COMPLEXITY OF COMBINATORIAL OPTIMIZATION PROBLEMS IN ONE CLASS OF ALGORITHMS
BONDARENKO, VA
DOKLADY AKADEMII NAUK, 1993, 328 (01) : 22 - 24
[44] SUCCINCT REPRESENTATION OF CODES WITH APPLICATIONS TO TESTING
Grigorescu, Elena
Kaufman, Tali
Sudan, Madhu
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2012, 26 (04) : 1618 - 1634
[45] On the complexity of some problems on groups input as multiplication tables
Barrington, DM
Kadau, P
Lange, KJ
McKenzie, P
15TH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 2000, : 62 - 69
[46] On the complexity of some problems on groups input as multiplication tables
Barrington, DM
Kadau, P
Lange, KJ
McKenzie, P
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2001, 63 (02) : 186 - 200
[47] SUCCINCT REPRESENTATIONS OF COUNTING PROBLEMS
TORAN, J
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 357 : 415 - 426
[48] Combinatorial Games: Selected Bibliography with a Succinct Gourmet Introduction
Fraenkel, Aviezri S.
ELECTRONIC JOURNAL OF COMBINATORICS, 2012,
[49] The cell probe complexity of succinct data structures
Gál, A
Miltersen, PB
AUTOMATA, LANGUAGES AND PROGRAMMING, PROCEEDINGS, 2003, 2719 : 332 - 344
[50] The cell probe complexity of succinct data structures
Gal, Anna
Miltersen, Peter Bro
THEORETICAL COMPUTER SCIENCE, 2007, 379 (03) : 405 - 417

← 1 2 3 4 5 →