ON THE INHERENT COMBINATORIAL COMPLEXITY OF GEOMETRIC PROBLEMS IN D - DIMENSIONAL SPACE

被引：0

|

作者：

FISCHER, TM

WOLFRUM, K

机构：

来源：

LECTURE NOTES IN COMPUTER SCIENCE | 1986年 / 233卷

关键词：

D O I：

暂无

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

引用

收藏

页码：315 / 324

页数：10

相关论文

共 50 条

[31] INHERENT COMPLEXITY TRADE-OFFS FOR RANGE QUERY PROBLEMS
BURKHARD, WA
FREDMAN, ML
KLEITMAN, DJ
THEORETICAL COMPUTER SCIENCE, 1981, 16 (03) : 279 - 290
[32] ON THE COMPLEXITY OF SOME GEOMETRIC PROBLEMS IN UNBOUNDED DIMENSION
MEGIDDO, N
JOURNAL OF SYMBOLIC COMPUTATION, 1990, 10 (3-4) : 327 - 334
[33] On the complexity of some geometric problems with fixed parameters
Schaefer M.
Journal of Graph Algorithms and Applications, 2021, 25 (01) : 195 - 218
[34] Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling
Yang, Zishen
Wang, Wei
Shi, Majun
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS, 2021, 188 (03) : 673 - 695
[35] COMPUTER-AIDED COMPLEXITY CLASSIFICATION OF COMBINATORIAL PROBLEMS
LAGEWEG, BJ
LENSTRA, JK
LAWLER, EL
KAN, AHGR
COMMUNICATIONS OF THE ACM, 1982, 25 (11) : 817 - 822
[36] SAT-VARIABLE COMPLEXITY OF HARD COMBINATORIAL PROBLEMS
IWAMA, K
MIYAZAKI, S
INFORMATION PROCESSING '94, VOL I: TECHNOLOGY AND FOUNDATIONS, 1994, 51 : 253 - 258
[37] SOME COMBINATORIAL ALGEBRAIC PROBLEMS FROM COMPLEXITY THEORY
PUDLAK, P
RODL, V
DISCRETE MATHEMATICS, 1994, 136 (1-3) : 253 - 279
[38] A Parameterized Complexity Analysis of Combinatorial Feature Selection Problems
Froese, Vincent
van Bevern, Rene
Niedermeier, Rolf
Sorge, Manuel
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2013, 2013, 8087 : 445 - 456
[39] Algorithms and Complexity for a Class of Combinatorial Optimization Problems with Labelling
Zishen Yang
Wei Wang
Majun Shi
Journal of Optimization Theory and Applications, 2021, 188 : 673 - 695
[40] A combinatorial geometric structure on the space of orders of a field .1.
Dickmann, MA
EUROPEAN JOURNAL OF COMBINATORICS, 1997, 18 (06) : 613 - 634

← 1 2 3 4 5 →