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

40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)最新文献

筛选
英文 中文
A non-linear time lower bound for Boolean branching programs 布尔分支程序的非线性时间下界
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814578
M. Ajtai
{"title":"A non-linear time lower bound for Boolean branching programs","authors":"M. Ajtai","doi":"10.1109/SFFCS.1999.814578","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814578","url":null,"abstract":"We prove that for all positive integer k and for all sufficiently small /spl epsiv/>0 if n is sufficiently large then there is no Boolean (or 2-way) branching program of size less than 2/sup em/ which for all inputs X/spl sube/{0, 1, ..., n-1} computes in time kn the parity of the number of elements of the set of all pairs (x,y) with the property x/spl isin/X, y/spl isin/X, x<y, x+y/spl isin/X. For the proof of this fact we show that if A=(/spl alpha//sub i,j/)/sub i=0, j=0//sup n/ is a random n by n matrix over the field with 2 elements with the condition that \"/spl forall/, j, k, l/spl isin/{0, 1, ..., n-1}, i+j=k+l implies /spl alpha//sub i,j/=/spl alpha//sub k,l/\" then with a high probability the rank of each /spl delta/n by /spl delta/n submatrix of A is at least c/spl delta/|log /spl delta/|/sup -2/n, where c>0 is an absolute constant and n is sufficiently large with respect to /spl delta/.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128101456","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}
引用次数: 103
Verifiable random functions 可验证随机函数
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814584
S. Micali, M. Rabin, S. Vadhan
{"title":"Verifiable random functions","authors":"S. Micali, M. Rabin, S. Vadhan","doi":"10.1109/SFFCS.1999.814584","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814584","url":null,"abstract":"We efficiently combine unpredictability and verifiability by extending the Goldreich-Goldwasser-Micali (1986) construction of pseudorandom functions f/sub s/ from a secret seed s, so that knowledge of s not only enables one to evaluate f/sub s/ at any point x, but also to provide an NP-proof that the value f/sub s/(x) is indeed correct without compromising the unpredictability of f/sub s/ at any other point for which no such a proof was provided.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134006513","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}
引用次数: 608
Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design] 平面图形在线性时间内的双欧拉轨迹求解[CMOS VLSI电路设计]
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814603
Zhi-Zhong Chen, Xin He, Chun-Hsi Huang
{"title":"Finding double Euler trails of planar graphs in linear time [CMOS VLSI circuit design]","authors":"Zhi-Zhong Chen, Xin He, Chun-Hsi Huang","doi":"10.1109/SFFCS.1999.814603","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814603","url":null,"abstract":"The paper answers an open question in the design of complimentary metal-oxide semiconductor (CMOS) VLSI circuits. It asks whether a polynomial-time algorithm can decide if a given planar graph has a plane embedding /spl epsiv/ such that /spl epsiv/ has a Euler trail P=e/sub 1/e/sub 2/...e/sub m/ and its dual graph has a Euler trail P*=e/sub 1/*e/sub 2/*...e/sub m/* where e/sub i/* is the dual edge of e/sub i/ for i=1, 2, ..., m. The paper answers this question in the affirmative by presenting a linear-time algorithm.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131814012","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}
引用次数: 9
Edge-disjoint routing in plane switch graphs in linear time 线性时间平面开关图的边不相交路由
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814604
K. Weihe
{"title":"Edge-disjoint routing in plane switch graphs in linear time","authors":"K. Weihe","doi":"10.1109/SFFCS.1999.814604","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814604","url":null,"abstract":"By a switch graph we mean an undirected graph G=(P/spl cup//spl dot/W,E) such that all vertices in P (the plugs) have degree one and all vertices in W (the switches) have even degrees. We call G plane if G is planar and can be embedded such that all plugs are in the outer face. Given a set (s/sub 1/,t/sub 1/), ..., (s/sub k/,t/sub k/) of pairs of plugs, the problem is to find edge-disjoint paths p/sub 1/, ..., p/sub k/ such that every p/sub i/ connects s/sub i/ with t/sub i/. The best asymptotic worst case complexity known so far is quadratic in the number of vertices. A linear, and thus asymptotically optimal algorithm is introduced. This result may be viewed as a concluding \"key-stone\" for a number of previous results on various special cases of the problem.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131909212","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}
引用次数: 11
Random walks on truncated cubes and sampling 0-1 knapsack solutions 截断立方体上的随机行走和0-1背包解的抽样
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814595
B. Morris, A. Sinclair
{"title":"Random walks on truncated cubes and sampling 0-1 knapsack solutions","authors":"B. Morris, A. Sinclair","doi":"10.1109/SFFCS.1999.814595","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814595","url":null,"abstract":"We solve an open problem concerning the mixing time of a symmetric random walk on an n-dimensional cube truncated by a hyperplane, showing that it is polynomial in n. As a consequence, we obtain a full-polynomial randomized approximation scheme for counting the feasible solutions of a 0-1 knapsack problem. The key ingredient in our analysis is a combinatorial construction we call a \"balanced almost uniform permutation\", which seems to be of independent interest.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114835043","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}
引用次数: 90
A near-tight lower bound on the time complexity of distributed MST construction 分布式MST构造时间复杂度的近紧下界
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814597
D. Peleg, Vitaly Rubinovich
{"title":"A near-tight lower bound on the time complexity of distributed MST construction","authors":"D. Peleg, Vitaly Rubinovich","doi":"10.1109/SFFCS.1999.814597","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814597","url":null,"abstract":"This paper presents a lower bound of /spl Omega/~(D+/spl radic/n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D=/spl Omega/(log n), in the bounded message model. This establishes the asymptotic near-optimality of existing time-efficient distributed algorithms for the problem, whose complexity is O(D+/spl radic/nlog* n).","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117116558","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}
引用次数: 98
The Directed Steiner Network problem is tractable for a constant number of terminals 有向斯坦纳网络问题对于一定数量的终端是可处理的
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814601
J. Feldman, M. Ruhl
{"title":"The Directed Steiner Network problem is tractable for a constant number of terminals","authors":"J. Feldman, M. Ruhl","doi":"10.1109/SFFCS.1999.814601","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814601","url":null,"abstract":"We consider the Directed Steiner Network (DSN) problem, also called the Point-to-Point Connection problem, where given a directed graph G and p pairs {(s/sub 1/,t/sub 1/), ..., (s/sub p/,t/sub p/)} of nodes in the graph, one has to find the smallest subgraph H of G that contains paths from s/sub i/ to t/sub i/ for all i. The problem is NP-hard for general p, since the Directed Steiner Tree problem is a special case. Until now, the complexity was unknown for constant p/spl ges/3. We prove that the problem is polynomially solvable if p is any constant number, even if nodes and edges in G are weighted and the goal is to minimize the total weight of the subgraph H. In addition, we give an efficient algorithm for the Strongly Connected Steiner Subgraph problem for any constant p, where given a directed graph and p nodes in the graph, one has to compute the smallest strongly connected subgraph containing the p nodes.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130593287","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}
引用次数: 63
On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis 论量子计算的普适性和容错性:肖尔基的一种新的普适性基础和新的建设性证明
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814621
P. Boykin, T. Mor, M. Pulver, V. Roychowdhury, F. Vatan
{"title":"On universal and fault-tolerant quantum computing: a novel basis and a new constructive proof of universality for Shor's basis","authors":"P. Boykin, T. Mor, M. Pulver, V. Roychowdhury, F. Vatan","doi":"10.1109/SFFCS.1999.814621","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814621","url":null,"abstract":"A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and /spl sigma//sub z//sup 1/4 /) and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of /spl pi/) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by P.W. Shor (1996) and A.Y. Kitaev (1997).","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127998267","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}
引用次数: 101
Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings 基于嵌入的豪斯多夫度量的近似最近邻算法
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814589
Martín Farach-Colton, P. Indyk
{"title":"Approximate nearest neighbor algorithms for Hausdorff metrics via embeddings","authors":"Martín Farach-Colton, P. Indyk","doi":"10.1109/SFFCS.1999.814589","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814589","url":null,"abstract":"Hausdorff metrics are used in geometric settings for measuring the distance between sets of points. They have been used extensively in areas such as computer vision, pattern recognition and computational chemistry. While computing the distance between a single pair of sets under the Hausdorff metric has been well studied, no results are known for the nearest-neighbor problem under Hausdorff metrics. Indeed, no results were known for the nearest-neighbor problem for any metric without a norm structure, of which the Hausdorff is one. We present the first nearest-neighbor algorithm for the Hausdorff metric. We achieve our result by embedding Hausdorff metrics into l/sub /spl infin// and by using known nearest-neighbor algorithms for this target metric. We give upper and lower bounds on the number of dimensions needed for such an l/sub /spl infin// embedding. Our bounds require the introduction of new techniques based on superimposed codes and non-uniform sampling.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127893214","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
Reducing network congestion and blocking probability through balanced allocation 通过均衡分配减少网络拥塞和阻塞概率
40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039) Pub Date : 1999-10-17 DOI: 10.1109/SFFCS.1999.814633
M. Luczak, E. Upfal
{"title":"Reducing network congestion and blocking probability through balanced allocation","authors":"M. Luczak, E. Upfal","doi":"10.1109/SFFCS.1999.814633","DOIUrl":"https://doi.org/10.1109/SFFCS.1999.814633","url":null,"abstract":"We compare the performance of a variant of the standard dynamic alternative routing (DAR) technique commonly used in telephone and ATM networks to a path selection algorithm that is based on the balanced allocations principle-the Balanced Dynamic Alternative Routing (BDAR) algorithm. While the standard technique checks alternative routes sequentially until available bandwidth is found, the BDAR algorithm compares and chooses the best among a small number of alternatives. We show that, at the expense of a minor increase in routing overhead, the BDAR gives a substantial improvement in network performance in terms of both network congestion and blocking probabilities.","PeriodicalId":385047,"journal":{"name":"40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039)","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"1999-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114424198","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信