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

Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)最新文献

筛选
英文 中文
Tseitin's tautologies and lower bounds for Nullstellensatz proofs tseittin的重言式和Nullstellensatz证明的下界
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743515
D. Grigoriev
{"title":"Tseitin's tautologies and lower bounds for Nullstellensatz proofs","authors":"D. Grigoriev","doi":"10.1109/SFCS.1998.743515","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743515","url":null,"abstract":"We use the known linear lower bound for Tseitin's tautologies for establishing linear lower bounds on the degree of Nullstellensatz proofs (in the usual boolean setting) for explicitly constructed systems of polynomials of a constant (in our construction 6) degree. It holds over any field of characteristic distinct from 2. Previously, a linear lower bound was proved for an explicitly constructed system of polynomials of a logarithmic degree.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116832368","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}
引用次数: 34
Map graphs in polynomial time 在多项式时间内映射图形
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743490
M. Thorup
{"title":"Map graphs in polynomial time","authors":"M. Thorup","doi":"10.1109/SFCS.1998.743490","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743490","url":null,"abstract":"Z. Chen et al. (1997, 1998) have introduced a modified notion of planarity, where two faces are considered adjacent if they share at least one point. The corresponding abstract graphs are called map graphs. Chen et al. raised the question of whether map graphs can be recognized in polynomial time. They showed that the decision problem is in NP and presented a polynomial time algorithm for the special case where we allow at most 4 faces to intersect in any point-for only 3 are allowed to intersect in a point, we get the usual planar graphs. Chen et al. conjectured that map graphs can be recognized in polynomial time, and in this paper, their conjecture is settled affirmatively.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116908312","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}
引用次数: 48
Informatin Retrieval on the Web 网络信息检索
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743423
A. Broder, M. Henzinger
{"title":"Informatin Retrieval on the Web","authors":"A. Broder, M. Henzinger","doi":"10.1109/SFCS.1998.743423","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743423","url":null,"abstract":"The Web explosion offers a bonanza of algorithmic problems. In particular, information retrieval in the web context requires methods and ideas that have not been addressed in the classic IR literature. This tutorial will survey emerging techniques for IR in the web context and discuss some of the pertinent open problems. The list of topics includes search engine technology, ranking and classification methods, web measurements (usage, size, connectivity), and new graph and data structure problems arising in the web IR context. 1 URL of Slides The slides of the talk can be found at http://www. research.digital.com/SRC/personal/Monika Henzinger/ slides.html ∗Compaq Systems Research Ctr., 130 Lytton Ave., Palo Alto, CA, 94301; http://www.research.digital.com/SRC/personal/Andrei Broder/ home.html; broder@pa.dec.com. †Compaq Systems Research Ctr., 130 Lytton Ave., Palo Alto, CA, 94301; http://www.research.digital.com/SRC/personal/ Monika Henzinger/home.html; monika@pa.dec.com.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130474923","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}
引用次数: 1
Which problems have strongly exponential complexity? 哪些问题具有强指数复杂度?
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743516
R. Impagliazzo, R. Paturi, F. Zane
{"title":"Which problems have strongly exponential complexity?","authors":"R. Impagliazzo, R. Paturi, F. Zane","doi":"10.1109/SFCS.1998.743516","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743516","url":null,"abstract":"For several NP-complete problems, there have been a progression of better but still exponential algorithms. In this paper we address the relative likelihood of sub-exponential algorithms for these problems. We introduce a generalized reduction which we call sub-exponential reduction family (SERF) that preserves sub-exponential complexity. We show that Circuit-SAT is SERF-complete for all NP-search problems, and that for any fixed k, k-SAT, k-Colorability, k-Set Cover Independent Set, Clique, Vertex Cover are SERF-complete for the class SNP of search problems expressible by second order existential formulas whose first order part is universal. In particular, sub-exponential complexity for any one of the above problems implies the same for all others. We also look at the issue of proving strongly exponential lower bounds (that is, bounds of the form 2/sup /spl Omega/(n)/) for AC/sup 0/. This problem is even open far depth-3 circuits. In fact, such a bound for depth-3 circuits with even limited (at most n/sup /spl epsiv//) fan-infer bottom-level gates would imply a nonlinear size lower bound for logarithmic depth circuits. We show that with high probability even degree 2 random GF(2) polynomials require strongly exponential site for /spl Sigma//sub 3//sup k/ circuits for k=o(loglogn). We thus exhibit a much smaller space of 2(0(/sup n2/)) functions such that almost every function in this class requires strongly exponential size /spl Sigma//sub 3//sup k/ circuits. As a corollary, we derive a pseudorandom generator (requiring O(n/sup 2/) bits of advice) that maps n bits into a larger number of bits so that computing parity on the range is hard for /spl Sigma//sub 3//sup k/ circuits. Our main technical lemma is an algorithm that, for any fixed /spl epsiv/>0, represents an arbitrary k-CNF formula as a disjunction of 2/sup /spl epsiv/n/ k-CNF formulas that are sparse, e.g., each having O(n) clauses.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126081251","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}
引用次数: 1440
Semidefinite relaxations for parallel machine scheduling 并行机器调度的半定松弛
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743498
M. Skutella
{"title":"Semidefinite relaxations for parallel machine scheduling","authors":"M. Skutella","doi":"10.1109/SFCS.1998.743498","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743498","url":null,"abstract":"We consider the problem of scheduling unrelated parallel machines so as to minimize the total weighted completion time of jobs. Whereas the best previously known approximation algorithms for this problem are based on LP relaxations, we give a 3/2-approximation algorithm that relies on a convex quadratic programming relaxation. For the special case of two machines we present a further improvement to a 1.2752-approximation; we introduce a more sophisticated semidefinite programming relaxation and apply the random hyperplane technique introduced by M.X. Goemans and D.P. Williamson (1995) for the MAXCUT problem and its refined version of U. Feige and M.X. Goemans (1995). To the best of our knowledge, this is the first time that convex and semidefinite programming techniques (apart from LPs) are used in the area of scheduling.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"07 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127289382","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}
引用次数: 31
Recommendation systems: a probabilistic analysis 推荐系统:一个概率分析
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743517
Ravi Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins
{"title":"Recommendation systems: a probabilistic analysis","authors":"Ravi Kumar, P. Raghavan, S. Rajagopalan, A. Tomkins","doi":"10.1109/SFCS.1998.743517","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743517","url":null,"abstract":"A recommendation system tracks past actions of a group of users to make recommendations to individual members of the group. The growth of computer-mediated marketing and commerce has led to increased interest in such systems. We introduce a simple analytical framework for recommendation systems, including a basis for defining the utility of such a system. We perform probabilistic analyses of algorithmic methods within this framework. These analyses yield insights into how much utility can be derived from the memory of past actions and on how this memory can be exploited.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114500641","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
Improved bounds and algorithms for hypergraph two-coloring 超图二次着色的改进界和算法
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743519
J. Radhakrishnan, A. Srinivasan
{"title":"Improved bounds and algorithms for hypergraph two-coloring","authors":"J. Radhakrishnan, A. Srinivasan","doi":"10.1109/SFCS.1998.743519","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743519","url":null,"abstract":"We show that for all large n, every n-uniform hypergraph with at most 0.7/spl radic/(n/lnn)/spl times/2/sup n/ edges can be two-colored. We, in fact, present fast algorithms that output a proper two-coloring with high probability for such hypergraphs. We also derandomize and parallelize these algorithms, to derive NC/sup 1/ versions of these results. This makes progress on a problem of Erdos (1963), improving the previous-best bound of n/sup 1/3-0(1)//spl times/2/sup n/ due to Beck (1978). We further generalize this to a \"local\" version, improving on one of the first applications of the Lovasz Local Lemma.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125389187","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}
引用次数: 14
Random projection: a new approach to VLSI layout 随机投影:VLSI布局的新方法
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743489
S. Vempala
{"title":"Random projection: a new approach to VLSI layout","authors":"S. Vempala","doi":"10.1109/SFCS.1998.743489","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743489","url":null,"abstract":"We show that random projection, the technique of projecting a set of points to a randomly chosen low-dimensional subspace, can be used to solve problems in VLSI layout. Specifically, for the problem of laying out a graph on a 2-dimensional grid so as to minimize the maximum edge length, we obtain an O(log/sup 3.5/ n) approximation algorithm (this is the first o(n) approximation), and for the bicriteria problem of minimizing the total edge length while keeping the maximum length bounded, we obtain an O(log/sup 3/ n, log/sup 3.5/ n) approximation. Our algorithms also work for d-dimensional versions of these problems (for any fixed d) with polylog approximation guarantees. Besides random projection, the main components of the algorithms are a linear programming relaxation, and volume-respecting Euclidean embeddings.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"372 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124653112","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}
引用次数: 47
Stability of adversarial queues via fluid models 基于流体模型的对抗队列的稳定性
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743429
D. Gamarnik
{"title":"Stability of adversarial queues via fluid models","authors":"D. Gamarnik","doi":"10.1109/SFCS.1998.743429","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743429","url":null,"abstract":"The subject of this paper is stability properties of adversarial queueing networks. Such queueing systems are used to model packet switch communication networks, in which packets are generated and routed dynamically, and have become a subject of research focus recently. Adversarial queueing networks are defined to be stable, if the number of packets stays bounded over time. A central question is determining which adversarial queueing networks are stable, when an arbitrary greedy packet routing policy is implemented. In this paper we show how stability of a queueing network can be determined by considering an associated fluid models. Our main result is that the stability of the fluid model implies the stability of an underlying adversarial queueing network. This opens an opportunity for analyzing stability of adversarial networks, using established stability methods from continuous time processes, for example, the method of Lyapunov function or trajectory decomposition. We demonstrate the use of these methods on several examples.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"17 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121128037","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}
引用次数: 44
Perfect information leader election in log*n+O(1) rounds 在log*n+O(1)轮中进行完全信息领袖选举
Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280) Pub Date : 1998-11-08 DOI: 10.1109/SFCS.1998.743508
A. Russell, David Zuckerman
{"title":"Perfect information leader election in log*n+O(1) rounds","authors":"A. Russell, David Zuckerman","doi":"10.1109/SFCS.1998.743508","DOIUrl":"https://doi.org/10.1109/SFCS.1998.743508","url":null,"abstract":"In the leader election problem, n players wish to elect a random leader. The difficulty is that some coalition of players may conspire to elect one of its own members. We adopt the perfect information model: all communication is by broadcast, and the bad players have unlimited computational power. Within a round, they may also wait to see the inputs of the good players. A protocol is called resilient if a good leader is elected with probability bounded away from 0. We give a simple, constructive leader election protocol that is resilient against coalitions of size /spl beta/n, for any /spl beta/<1/2. Our protocol takes log*n+O(1) rounds, each player sending at most log n bits per round. For any constant k, our protocol can be modified to take k rounds and be resilient against coalitions of size /spl epsi/n(log/sup (k)/n)/sup 3/, where /spl epsi/ is a small enough constant and log(k) denotes the logarithm iterated k times. This is constructive for k/spl ges/3.","PeriodicalId":228145,"journal":{"name":"Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280)","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1998-11-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129684645","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}
引用次数: 76
首页 上一页 下一页 尾页
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学术官方微信
小红书