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 条
  • [41] Combinatorial approaches to geometric constraint solving: Problems, progress and directions
    Sitharam, M
    GEOMETRIC AND ALGORITHMIC ASPECTS OF COMPUTER-AIDED DESIGN AND MANUFACTURING, 2005, 67 : 117 - 163
  • [42] ON SOME DETERMINISTIC SPACE COMPLEXITY PROBLEMS
    HONG, JW
    SIAM JOURNAL ON COMPUTING, 1982, 11 (03) : 591 - 601
  • [43] Space Complexity and Word Problems of Groups
    Lakin, Stephen R.
    Thomas, Richard M.
    GROUPS COMPLEXITY CRYPTOLOGY, 2009, 1 (02) : 261 - 273
  • [44] On the time-space complexity of geometric elimination procedures
    Heintz, J
    Matera, G
    Waissbein, A
    APPLICABLE ALGEBRA IN ENGINEERING COMMUNICATION AND COMPUTING, 2001, 11 (04) : 239 - 296
  • [45] ON THE COMPLEXITY OF SOME COMMON GEOMETRIC LOCATION-PROBLEMS
    MEGIDDO, N
    SUPOWIT, KJ
    SIAM JOURNAL ON COMPUTING, 1984, 13 (01) : 182 - 196
  • [46] Parameterized Complexity of Geometric Covering Problems Having Conflicts
    Aritra Banik
    Fahad Panolan
    Venkatesh Raman
    Vibha Sahlot
    Saket Saurabh
    Algorithmica, 2020, 82 : 1 - 19
  • [47] Combinatorial complexity of translating a box in polyhedral 3-space
    Halperin, D
    Yap, CK
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 9 (03): : 181 - 196
  • [48] Parameterized Complexity of Geometric Covering Problems Having Conflicts
    Banik, Aritra
    Panolan, Fahad
    Raman, Venkatesh
    Sahlot, Vibha
    Saurabh, Saket
    ALGORITHMICA, 2020, 82 (01) : 1 - 19
  • [49] Parameterized Complexity of Geometric Covering Problems Having Conflicts
    Banik, Aritra
    Panolan, Fahad
    Raman, Venkatesh
    Sahlot, Vibha
    Saurabh, Saket
    ALGORITHMS AND DATA STRUCTURES: 15TH INTERNATIONAL SYMPOSIUM, WADS 2017, 2017, 10389 : 61 - 72
  • [50] The computational complexity and approximability of a series of geometric covering problems
    Khachai, M. Yu.
    Poberii, M. I.
    PROCEEDINGS OF THE STEKLOV INSTITUTE OF MATHEMATICS, 2013, 283 : 64 - 77
12345