28th Annual Symposium on Foundations of Computer Science (sfcs 1987)最新文献_第4页

Generic oracles and oracle classes 通用的oracle和oracle类

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.30

M. Blum, R. Impagliazzo

引用次数: 147

Lower bounds to randomized algorithms for graph properties 图属性随机化算法的下界

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.39

A. Yao

引用次数: 50

A new parallel algorithm for the maximal independent set problem 求解最大独立集问题的一种新的并行算法

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1137/0218029

M. Goldberg, T. Spencer

引用次数: 121

Functional decomposition of polynomials 多项式的泛函分解

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.29

J. Gathen, D. Kozen, S. Landau

{"title":"Functional decomposition of polynomials","authors":"J. Gathen, D. Kozen, S. Landau","doi":"10.1109/SFCS.1987.29","DOIUrl":"https://doi.org/10.1109/SFCS.1987.29","url":null,"abstract":"Fast DecoIIlposition in the tame case 2 polynomials over F. We obtain a range of results, trom Ulldecidability over sufficiently general fields to fast sequential and parallel algorithms over finite fields. A version of the algorithm of Theorem 1 below has beel implemented [2,6J and compares favorably with [3J. Dick erson [9J has extended some of these results to multivariate polynomials. We should give a brief history of the research behind this joint paper. Kozen and Landau [18] gave the first polynomial-time sequential and NCalgorithms for this problem in the tame case. The time hounds were O(n3 ) sequential, O(n ) if F supports an FFT, and 0(1og2 n) parallel. They also presented the structure theorem (Theorem 9), reducing the problem in the wild case to factorization, and gave an O(n ) algorithm for the decomposition of irreducible polynomials over general fields admitting a polynomial-time factorization algorithm, and an NC algorithm for irreducible polynomials over finite fields. Based on the algorithm of [18], von zur Gathen [17] improved the bounds in the tame case to those stated above. These results are presented in §2. He also gave an improved algorithm for the wild case, yielding a polynomial-time reduction to factorization of polynomials, and observed undecidability over sufficiently general fields. These results are presented in §3. Introduction 1","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122885727","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}

引用次数: 37

Concurrent reading while writing II: The multi-writer case 写时并发读II:多写器情况

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.15

G. Peterson, J. Burns

引用次数: 101

Determining edge connectivity in 0(nm) 确定0(nm)内的边缘连通性

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.19

D. Matula

引用次数: 98

A practical scheme for non-interactive verifiable secret sharing 一种实用的非交互式可验证秘密共享方案

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.4

Paul Feldman

引用次数: 1213

New lower bound techniques for robot motion planning problems 机器人运动规划问题的新下界技术

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.42

J. Canny, J. Reif

{"title":"New lower bound techniques for robot motion planning problems","authors":"J. Canny, J. Reif","doi":"10.1109/SFCS.1987.42","DOIUrl":"https://doi.org/10.1109/SFCS.1987.42","url":null,"abstract":"We present new techniques for establishing lower bounds in robot motion planning problems. Our scheme is based on path encoding and uses homotopy equivalence classes of paths to encode state. We first apply the method to the shortest path problem in 3 dimensions. The problem is to find the shortest path under an Lp metric (e.g. a euclidean metric) between two points amid polyhedral obstacles. Although this problem has been extensively studied, there were no previously known lower bounds. We show that there may be exponentially many shortest path classes in single-source multiple-destination problems, and that the single-source single-destination problem is NP-hard. We use a similar proof technique to show that two dimensional dynamic motion planning with bounded velocity is NP-hard. Finally we extend the technique to compliant motion planning with uncertainty in control. Specifically, we consider a point in 3 dimensions which is commanded to move in a straight line, but whose actual motion may differ from the commanded motion, possibly involving sliding against obstacles. Given that the point initially lies in some start region, the problem of finding a sequence of commanded velocities which is guaranteed to move the point to the goal is shown to be non-deterministic exponential time hard, making it the first provably intractable problem in robotics.","PeriodicalId":153779,"journal":{"name":"28th Annual Symposium on Foundations of Computer Science (sfcs 1987)","volume":"50 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-10-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131069988","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}

引用次数: 602

Applying static network protocols to dynamic networks 将静态网络协议应用于动态网络

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.7

Y. Afek, B. Awerbuch, E. Gafni

引用次数: 137

Complete and incomplete randomized NP problems 完全和不完全随机NP问题

28th Annual Symposium on Foundations of Computer Science (sfcs 1987) Pub Date : 1987-10-12 DOI: 10.1109/SFCS.1987.14

Y. Gurevich

引用次数: 43