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

Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems最新文献

筛选
英文 中文
Weak alternating automata are not that weak 弱交变自动机并没有那么弱
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595167
O. Kupferman, Moshe Y. Vardi
{"title":"Weak alternating automata are not that weak","authors":"O. Kupferman, Moshe Y. Vardi","doi":"10.1109/ISTCS.1997.595167","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595167","url":null,"abstract":"Automata on infinite words are used for specification and verification of nonterminating programs. Different types of automata induce different levels of expressive power, of succinctness, and of complexity. Alternating automata have both existential and universal branching modes and are particularly suitable for specification of programs. In a weak alternating automaton, the state space is partitioned into partially ordered sets, and the automaton can proceed from a certain set only to smaller sets. Reasoning about weak alternating automata is easier than reasoning about alternating automata with no restricted structure. Known translations of alternating automata to weak alternating automata involve determinization, and therefore involve a double-exponential blow-up. In this paper we describe a quadratic translation, which circumvents the need for determinization, of Buchi (1962) and co-Buchi alternating automata to weak alternating automata. Beyond the independent interest of such a translation, it gives rise to a simple complementation algorithm for nondeterministic Buchi automata.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123586072","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}
引用次数: 300
On the total/sub k/-diameter of connection networks 关于连接网络的总/分k/-直径
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595161
Yefim Dinitz, T. Eilam, S. Moran, S. Zaks
{"title":"On the total/sub k/-diameter of connection networks","authors":"Yefim Dinitz, T. Eilam, S. Moran, S. Zaks","doi":"10.1109/ISTCS.1997.595161","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595161","url":null,"abstract":"We study connection networks in which certain pairs of nodes have to be connected by k edge-disjoint paths, and study bounds for the minimal sum of lengths of such k paths. We define the related notions of total/sub k/-distance for a pair of nodes and total/sub k/-diameter of a connection network, and study the value TD/sub k/(d) which is the maximal such total/sub k/-diameter of a network with diameter d. These notions have applications in fault-tolerant routing problems, in ATM networks, and in compact routing in networks. We prove an upper bound on TD/sub k/(d) and a lower bound on the growth of TD/sub k/(d) as functions of k and d; those bounds are tight, /spl theta/(d/sup k/), when k is fired. Specifically, we prove that TD/sub k/(d)/spl les/2/sup k-1/d/sup k/, with the exceptions TD/sub 2/(1)=3, TD/sub 3/(1)=5, and that for every k, d/sub 0/>0, there exists (a) an integer d/spl ges/d/sub 0/ such that TD/sub k/(d)/spl ges/d/sup k/k/sup k/; and (b) a k-connected simple graph G with diameter d such that d/spl ges/d/sub 0/, and td/sub k/(G)/spl ges/(d-2)/sup k//k/sup k/.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124860326","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}
引用次数: 2
Exact analysis of exact change 精确分析精确的变化
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595162
P. Frankel
{"title":"Exact analysis of exact change","authors":"P. Frankel","doi":"10.1109/ISTCS.1997.595162","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595162","url":null,"abstract":"We consider the k-payment problem: given a total budget of N units, the problem is to represent this budget as a set of coins, so that any k exact payments of total value at most N can be made using k disjoint subsets of the coins. The goal is to minimize the number of coins for any given N and k, while allowing the actual payments to be made on-line, namely without the need to know all payment requests in advance. The problem is motivated by the electronic cash model, where each coin is a long bit sequence, and typical electronic wallets have only limited storage capacity. The k-payment problem has additional applications in other resource-sharing scenarios. Our results include a complete characterization of the k-payment problem as follows. First, we prove a necessary and sufficient condition for a given set of coins to solve the problem. Using this characterization, we prove that the number of coins in any solution to the k-payment problem is at least kH/sub N/k/, where H/sub n/ denotes the nth element in the harmonic series. This condition can also be used to efficiently determine k (the maximal number of exact payments) which a given set of coins allows in the worst case. Secondly, we give an algorithm which produces, for any N and k, a solution with minimal number of coins. In the case that all denominations are available, the algorithm finds a coin allocation with at most (k+1)H/sub N/(k+1)/ coins (both upper and lower bounds are the best possible). Finally, we show how to generalize the algorithm to the case where some of the denominations are not available.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115417748","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}
引用次数: 3
Commutative queries 可交换的查询
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595168
R. Beigel, Richard Chang
{"title":"Commutative queries","authors":"R. Beigel, Richard Chang","doi":"10.1109/ISTCS.1997.595168","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595168","url":null,"abstract":"We consider polynomial-time Turing machines that have access to two oracles and investigate when the order of oracle queries is significant. The oracles used here are complete languages for the Polynomial Hierarchy (PH). We prove that, for solving decision problems, the order of oracle queries does not matter. This improves upon the previous result of Hemaspaandra, Hemaspaandra and Hempel, who showed that the order of the queries does not matter if the base machine asks only one query to each oracle. On the other hand, we prove that, for computing functions, the order of oracle queries does matter unless PH collapses.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"89 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115652323","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}
引用次数: 13
Minimax relations for T-join packing problems t联接填充问题的极大极小关系
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595155
Jaime Cohen, C. Lucchesi
{"title":"Minimax relations for T-join packing problems","authors":"Jaime Cohen, C. Lucchesi","doi":"10.1109/ISTCS.1997.595155","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595155","url":null,"abstract":"In this paper we present structural and algorithmic results for problems involving the packing of T-joins. We explore minimax relations that relate the size of a packing of T-joins with the size of a minimum T-cut in a graph. We present a new conjecture stating that if all T-cuts have the same parity then the maximum size of a family of T-joins that uses each edge at most twice equals the double of the size of a minimum T-cut. We show that this conjecture is equivalent to a famous conjecture for perfect matchings. We also prove a theorem for the case |T|/spl les/8 and describe a polynomial time algorithm for the maximization problem.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131349672","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}
引用次数: 5
Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson MAX SAT的近似算法:Yannakakis vs. Goemans-Williamson
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595154
Takao Asano
{"title":"Approximation algorithms for MAX SAT: Yannakakis vs. Goemans-Williamson","authors":"Takao Asano","doi":"10.1109/ISTCS.1997.595154","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595154","url":null,"abstract":"MAX SAT (the maximum satisfiability problem) is stated as follows: given a set of clauses with weights, find a truth assignment that maximizes the sum of the weights of the satisfied clauses. In this paper, we consider approximation algorithms for MAX SAT proposed by Yannnkakis and Goemans-Williamson and present an approximation algorithm which is an improvement of Yannakakis' algorithm. Although Yannakakis' original algorithm has no better performance guarantee than Goemans-Williamson, our improved algorithm has a better performance guarantee and leads to a 0.770 approximation algorithm.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123154268","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}
引用次数: 43
Learning with queries corrupted by classification noise 使用被分类噪声破坏的查询进行学习
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595156
J. C. Jackson, E. Shamir, Clara Shwartzman
{"title":"Learning with queries corrupted by classification noise","authors":"J. C. Jackson, E. Shamir, Clara Shwartzman","doi":"10.1109/ISTCS.1997.595156","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595156","url":null,"abstract":"Kearns introduced the \"statistical query\" (SQ) model as a general method for producing learning algorithms which are robust against classification noise. We extend this approach in several ways, in order to tackle algorithms that use \"membership queries\": focusing on the more stringent model of \"persistent noise\". The main ingredients in the general analysis are: (1) Smallness of dimension of both the targets' class and the queries' class. (2) Independence of the noise variables. Persistence restricts independence forcing repeated invocation of the same point x to give the same label. We apply the general analysis and ad-hoc considerations to get noise-robust version of Jackson's Harmonic Sieve (1995), which learns DNF under the uniform distribution. This corrects an error in his earlier analysis of noise tolerant DNF learning.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128725105","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}
引用次数: 23
Effect of operators on straight line complexity 算子对直线复杂度的影响
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-06-17 DOI: 10.1109/ISTCS.1997.595151
D. Boneh, R. Lipton
{"title":"Effect of operators on straight line complexity","authors":"D. Boneh, R. Lipton","doi":"10.1109/ISTCS.1997.595151","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595151","url":null,"abstract":"This paper concerns lower bounds on the straight line complexity of multi-variate polynomials. We obtain a conditional result showing that certain explicit linear operators must greatly increase the complexity of some polynomials. We do so by showing that if these operators roughly preserve the complexity of all polynomials then, co-NP is in AM. We show that certain explicit operators must vastly increase the straight line complexity of certain polynomials.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127215365","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}
引用次数: 4
An exact quantum polynomial-time algorithm for Simon's problem 西蒙问题的精确量子多项式时间算法
Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems Pub Date : 1997-04-14 DOI: 10.1109/ISTCS.1997.595153
G. Brassard, P. Høyer
{"title":"An exact quantum polynomial-time algorithm for Simon's problem","authors":"G. Brassard, P. Høyer","doi":"10.1109/ISTCS.1997.595153","DOIUrl":"https://doi.org/10.1109/ISTCS.1997.595153","url":null,"abstract":"We investigate the power of quantum computers when they are required to return an answer that is guaranteed to be correct after a time that is upper-bounded by a polynomial in the worst case. We show that a natural generalization of Simon's problem can be solved in this way, whereas previous algorithms required quantum polynomial time in the expected sense only, without upper bounds on the worst-case running time. This is achieved by generalizing both Simon's and Grover's algorithms and combining them in a novel way. It follows that there is a decision problem that can be solved in exact quantum polynomial time, which would require expected exponential time on any classical bounded-error probabilistic computer if the data is supplied as a black box.","PeriodicalId":367160,"journal":{"name":"Proceedings of the Fifth Israeli Symposium on Theory of Computing and Systems","volume":"394 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-04-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116651238","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}
引用次数: 280
首页 上一页
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学术官方微信