发布求助
文献互助 智能选刊 最新文献

Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science最新文献

筛选
英文 中文
Approximating shortest superstrings 逼近最短超弦
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1997-04-01 DOI: 10.1109/SFCS.1993.366871
S. Teng, F. Yao
{"title":"Approximating shortest superstrings","authors":"S. Teng, F. Yao","doi":"10.1109/SFCS.1993.366871","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366871","url":null,"abstract":"The Shortest Superstring Problem is to find a shortest possible string that contains every string in a given set as substrings. This problem has applications to data compression and DNA sequencing. As the problem is NP-hard and MAX SNP-hard, approximation algorithms are of interest. We present a new algorithm which always finds a superstring that is at most 2.89 times as long as the shortest superstring. Our result improves the 3-approximation result of Blum, Jiang, Li, Tromp, and Yannakakis (1991).<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114975955","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 71
On bounded queries and approximation 关于有界查询和近似
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366832
Richard Chang, W. Gasarch, C. Lund
{"title":"On bounded queries and approximation","authors":"Richard Chang, W. Gasarch, C. Lund","doi":"10.1109/SFCS.1993.366832","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366832","url":null,"abstract":"This paper investigates the computational complexity of approximating NP-optimization problems using the number of queries to an NP oracle as a complexity measure. The results show a trade-off between the closeness of the approximation and the number of queries required. For an approximation factor k(n), loglog/sub k(n/) n queries to an NP oracle can be used to approximate the maximum clique size of a graph within a factor of k(n). However, this approximation cannot be achieved using fewer than loglog/sub k(n/) n-c queries to any oracle unless P=NP, where c is a constant that does not depend on k. These results hold when k(n) belongs to a class of functions which include any integer constant function, log n, log/sup a/ n and n/sup 1/a/. Similar results are obtained for graph coloring, set cover and other NP-optimization problems.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"378 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115307636","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 21
Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment 多边形环境中多边形运动规划问题的近二次界
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366849
D. Halperin, M. Sharir
{"title":"Near-quadratic bounds for the motion planning problem for a polygon in a polygonal environment","authors":"D. Halperin, M. Sharir","doi":"10.1109/SFCS.1993.366849","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366849","url":null,"abstract":"We consider the problem of planning the motion of an arbitrary k-sided polygonal robot B, free to translate and rotate in a polygonal environment V bounded by n edges. We show that the combinatorial complexity of a single connected component of the free configuration space of B is k/sup 3/n/sup 2/2/sup O(log(2/3)/ n). This is a significant improvement of the naive bound O((kn)/sup 3/); when k is constant, which is often the case in practice, this yields a near-quadratic bound on the complexity of such a component, which almost settles (in this special case) a long-standing conjecture regarding the complexity of a single cell in a three-dimensional arrangement of surfaces. We also present an algorithm that constructs a single component of the free configuration space of B in time O(n/sup 2+/spl epsi//), for any /spl epsi/>0, assuming B has a constant number of sides. This algorithm, combined with some standard techniques in motion planning, yields a solution to the underlying motion planning problem, within the same asymptotic running time.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122684261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 18
A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed 一种固定维数多面体中积分点计数的多项式时间算法
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366830
A. Barvinok
{"title":"A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed","authors":"A. Barvinok","doi":"10.1109/SFCS.1993.366830","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366830","url":null,"abstract":"We prove that for any dimension d there exists a polynomial time algorithm for counting integral points in polyhedra in the d-dimensional Euclidean space. Previously such algorithms were known for dimensions d=1,2,3, and 4 only.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"66 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122230936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 453
Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs 利用预测难度减少计算量:熵有界输入的快速排序、优先队列和凸包
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366877
Shenfeng Chen, J. Reif
{"title":"Using difficulty of prediction to decrease computation: fast sort, priority queue and convex hull on entropy bounded inputs","authors":"Shenfeng Chen, J. Reif","doi":"10.1109/SFCS.1993.366877","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366877","url":null,"abstract":"Studies have indicated that sorting comprises about 20% of all computing on mainframes. Perhaps the largest use of sorting in computing (particularly business computing) is the sort required for large database operations (e.g. required by joint operations). In these applications the keys are many words long. Since our sorting algorithm hashes the key (rather than compare entire keys as in comparison sorts such as quicksort), our algorithm is even more advantageous in the case of large key lengths; in that case the cutoff is much lower. In case that the compression ratio is high, which can be determined after building the dictionary, we just adopt the previous sorting algorithm, e.g. quick sort. The same techniques can be extended to other problems (e.g. computational geometry problems) to decrease computation by learning the distribution of the inputs.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114635597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 15
Efficient computation of Euclidean shortest paths in the plane 欧几里得最短路径在平面上的有效计算
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366836
J. Hershberger, S. Suri
{"title":"Efficient computation of Euclidean shortest paths in the plane","authors":"J. Hershberger, S. Suri","doi":"10.1109/SFCS.1993.366836","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366836","url":null,"abstract":"We propose a new algorithm for a classical problem in plane computational geometry: computing a shortest path between two points in the presence of polygonal obstacles. Our algorithm runs in worst-case time O(nlog/sup 2/ n) and requires O(nlog n) space, where n is the total number of vertices in the obstacle polygons. Our algorithm actually computes a planar map that encodes shortest paths from a fixed source point to all other points of the plane; the map can be used to answer single-source shortest path queries in O(log n) time. The time complexity of our algorithm is a significant improvement over all previous results known for the shortest path problem.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132701824","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 74
Testing equalities of multiplicative representations in polynomial time 在多项式时间内检验乘法表示的等式
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366845
Guoqiang Ge
{"title":"Testing equalities of multiplicative representations in polynomial time","authors":"Guoqiang Ge","doi":"10.1109/SFCS.1993.366845","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366845","url":null,"abstract":"For multiplicative representations /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ and /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/ where /spl alpha//sub i/, /spl beta//sub j/ are non-zero elements of some algebraic number field K and n/sub i/, m/sub j/ are rational integers, we present a deterministic polynomial time algorithm that decides whether /spl Pi//sub i=1//sup k//spl alpha//sub i//sup n(i)/ equals /spl Pi//sub j=1//sup l//spl beta//sub j//sup m(j)/. The running time of the algorithm is polynomial in the number of bits required to represent the number field K, the elements /spl alpha//sub i/, /spl beta//sub j/ and the integers n/sub i/, m/sub j/.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116795368","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 30
Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions 一维和二维的最优快速并行预处理和模式匹配算法
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366862
R. Cole, M. Crochemore, Z. Galil, L. Gąsieniec, R. Hariharan, S. Muthukrishnan, Kunsoo Park, W. Rytter
{"title":"Optimally fast parallel algorithms for preprocessing and pattern matching in one and two dimensions","authors":"R. Cole, M. Crochemore, Z. Galil, L. Gąsieniec, R. Hariharan, S. Muthukrishnan, Kunsoo Park, W. Rytter","doi":"10.1109/SFCS.1993.366862","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366862","url":null,"abstract":"All algorithms below are optimal alphabet-independent parallel CRCW PRAM algorithms. In one dimension: Given a pattern string of length m for the string-matching problem, we design an algorithm that computes a deterministic sample of a sufficiently long substring in constant time. This problem used to be a bottleneck in the pattern preprocessing for one- and two-dimensional pattern matching. The best previous time bound was O(log/sup 2/ m/log log m). We use this algorithm to obtain the following results. 1. Improving the preprocessing of the constant-time text search algorithm from O(log/sup 2/ m/log log m) to n(log log m), which is now best possible. 2. A constant-time deterministic string-matching algorithm in the case that the text length n satisfies n=/spl Omega/(m/sup 1+/spl epsiv//) for a constant /spl epsiv/>0. 3. A simple probabilistic string-matching algorithm that has constant time with high probability for random input. 4. A constant expected time Las-Vegas algorithm for computing the period of the pattern and all witnesses and thus string matching itself, solving the main open problem remaining in string matching.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130856324","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 59
Learning an intersection of k halfspaces over a uniform distribution 学习k个半空间在均匀分布上的交集
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366856
Avrim Blum, R. Kannan
{"title":"Learning an intersection of k halfspaces over a uniform distribution","authors":"Avrim Blum, R. Kannan","doi":"10.1109/SFCS.1993.366856","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366856","url":null,"abstract":"We present a polynomial-time algorithm to learn an intersection of a constant number of halfspaces in n dimensions, over the uniform distribution on an n-dimensional ball. The algorithm we present in fact can learn an intersection of an arbitrary (polynomial) number of halfspaces over this distribution, if the subspace spanned by the normal vectors to the bounding hyperplanes has constant dimension. This generalizes previous results for this distribution, in particular a result of E.B. Baum (1990) who showed how to learn an intersection of 2 halfspaces defined by hyperplanes that pass through the origin (his results in fact held for a variety of symmetric distributions). Our algorithm uses estimates of second moments to find vectors in a low-dimensional \"relevant subspace\". We believe that the algorithmic techniques studied here may be useful in other geometric learning applications.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125429709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 36
Logical reducibility and monadic NP 逻辑可约性与一元NP
Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science Pub Date : 1993-11-03 DOI: 10.1109/SFCS.1993.366882
S. Cosmadakis
{"title":"Logical reducibility and monadic NP","authors":"S. Cosmadakis","doi":"10.1109/SFCS.1993.366882","DOIUrl":"https://doi.org/10.1109/SFCS.1993.366882","url":null,"abstract":"It is shown that, by choosing appropriate encodings of instances as relational structures, several known polynomial-time many-one reductions can he described in first-order logic, and furthermore they are monadic. As a corollary, several known NP-complete problems in monadic NP are shown not to be in monadic co-NP. It is further shown that there is no monadic first-order reduction from connectivity to directed reachability, even in the presence of successor. Finally, some classes of syntactically restricted first-order reductions are shown to be incomparable.<<ETX>>","PeriodicalId":253303,"journal":{"name":"Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science","volume":"39 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-11-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121138937","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 22
下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信