How hard are n 2 -hard problems?-Reference-Cited by-同舟云学术

How hard are n 2 -hard problems?

Published:1994-06 Issue:2 Volume:25 Page:83-85
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Bloch Stephen A.,Buss Jonathan F.,Goldsmith Judy

Abstract

Many of the " n 2 -hard" problems described by Gajentaan and Overmars can be solved using limited nondeterminism or other sharply-bounded quantifiers. Thus we suggest that problems are not among the hardest problems solvable in quadratic time

Publisher

Association for Computing Machinery (ACM)

Link

https://dl.acm.org/doi/pdf/10.1145/181462.181465

Reference6 articles.

1. [ 1 ] S. A. Bloch J. F. Buss J. Goldsmith "Sharply Bounded Quantifiers within P " technical report CS94-21. University of Waterloo 1994. [1] S. A. Bloch J. F. Buss J. Goldsmith "Sharply Bounded Quantifiers within P " technical report CS94-21. University of Waterloo 1994.

2. [ 2 ] S. A. Bloch J. Goldsmith "Sharply Bounded Alternation within P " technical report 92-04 University of Manitoba 1992. [2] S. A. Bloch J. Goldsmith "Sharply Bounded Alternation within P " technical report 92-04 University of Manitoba 1992.

3. Nondeterminism within $P^ * $

4. [ 4 ] A. Gajentaan M. H. Overmars "n2-Hard Problems in Computational Geometry " techical report RUU_CS-93-15 Utrecht Univ. 1993. [4] A. Gajentaan M. H. Overmars " n 2 -Hard Problems in Computational Geometry " techical report RUU_CS-93-15 Utrecht Univ. 1993.

5. Computational geometry

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Effective Guessing Has Unlikely Consequences;Theory of Computing Systems;2023-03-25

2. On a class of O(n2) problems in computational geometry;Computational Geometry;2012-05

3. New Lower Bounds for Convex Hull Problems in Odd Dimensions;SIAM Journal on Computing;1999-01

4. Limited nondeterminism;ACM SIGACT News;1996-07

5. On a class of O(n2) problems in computational geometry;Computational Geometry;1995-10