{"title":"Randomized simultaneous messages: solution of a problem of Yao in communication complexity","authors":"L. Babai, P. G. Kimmel","doi":"10.1109/CCC.1997.612319","DOIUrl":"https://doi.org/10.1109/CCC.1997.612319","url":null,"abstract":"We solve a 17 year old problem of A.C.C. Yao (1979). In the two-player communication model introduced by Yao in 1979, Alice and Bob wish to collaboratively evaluate a function f(x,y) in which Alice knows only input x and Bob knows only input y. Both players have unlimited computational power. The objective is to minimize the amount of communication. Yao (1979) also introduced an oblivious version of this communication game which we call the simultaneous messages (SM) model. The difference is that in the SM model, Alice and Bob don't communicate with each other. Instead, they simultaneously send messages to a referee, who sees none of the input. The referee then announces the function value. The deterministic two-player SM complexity of any function is straight forward to determine. Yao suggested the randomized version of this model, where each player has access to private coin flips. Our main result is that the order of magnitude of the randomized SM complexity of any function f is at least the square root of the deterministic SM complexity of f. We found this result in February 1996, independently but subsequently to I. Newman and M. Szegedy (1996) who obtained this lower bound for the special case of the \"equality\" function. Our proof is entirely different from and considerably simpler than the Newman-Szegedy solution. A proof similar in spirit to ours, was found by J. Bourgain and A. Wigderson simultaneously to us (unpublished); we include an outline of their proof. The quadratic reduction actually does occur for the \"equality\" function. We give a new proof of this fact. This result, combined with our main result, settles Yao's question, asking the exact randomized SM complexity of the equality function. The lower bound proof uses the probabilistic method; the upper bound uses linear algebra. We also give a constructive proof that O(log n) public coins reduce the complexity of \"equality\" to constant.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127460461","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}
{"title":"Tight bound on Johnson's algorithm for Max-SAT","authors":"Jianer Chen, D. Friesen, Hao Zheng","doi":"10.1109/CCC.1997.612322","DOIUrl":"https://doi.org/10.1109/CCC.1997.612322","url":null,"abstract":"We present a new technique that gives a more thorough analysis on Johnson's classical algorithm for the maximum satisfiability problem. In contrast to the common belief for two decades that Johnson's algorithm has performance ratio 1/2, we show that the performance ratio is 2/3, and that this bound is tight. Moreover we show that simple generalizations of Johnson's algorithm do not improve the performance ratio bound 2/3.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129783279","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}
{"title":"Separating NP-completeness notions under strong hypotheses","authors":"K. Ambos-Spies, Levke Bentzien","doi":"10.1109/CCC.1997.612307","DOIUrl":"https://doi.org/10.1109/CCC.1997.612307","url":null,"abstract":"J.H. Lutz (1993) proposed the study of the structure of the class NP=NTIME(poly) under the hypothesis that NP does not have p-measure 0 (with respect to Lutz's resource bounded measure. J.H. Lutz and E. Mayordomo (1996) showed that, under this hypothesis, NP-m-completeness and NP-T-completeness differ and they conjectured that further NP-completeness notions can be separated. Here we prove this conjecture for the bounded-query reducibilities. In fact we consider a new weaker hypothesis, namely the assumption that NP is not p-meager with respect to the resource bounded Baire category concept of Ambos-Spies et al.. We show that this category hypothesis is sufficient to get: (i) For every k/spl ges/2, NP-btt(k)-completeness is stronger than NP-btt(k+1)-completeness. (ii) For every k/spl ges/1, NP-bT(k)-completeness and NP-btt(k+1)-completeness are both stronger than NP-bT(k+1)-completeness. (iii) NP-btt-completeness is stronger than NP-tt-completeness.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126229843","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}
{"title":"Finite limits and monotone computations: the lower bounds criterion","authors":"S. Jukna","doi":"10.1109/CCC.1997.612325","DOIUrl":"https://doi.org/10.1109/CCC.1997.612325","url":null,"abstract":"Our main result is a combinatorial lower bounds criterion for monotone circuits over the reals. We allow any unbounded fanin non-decreasing real-valued functions as gates. The only requirement is their \"locality\". Unbounded fanin AND and OR gates, as well as any threshold gate T/sub s//sup m/(x/sub 1/,...,x/sub m/) with small enough threshold value min{s,m-s+1}, are simplest examples of local gates. The proof is relatively simple and direct, and combines the bottlenecks counting approach of Haken with the idea of finite limit due to Sipser. Apparently this is the first combinatorial lower bounds criterion for monotone computations. It is symmetric and yields (in a uniform and easy way) exponential lower bounds.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115891525","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}
{"title":"Constraint satisfaction: the approximability of minimization problems","authors":"S. Khanna, M. Sudan, L. Trevisan","doi":"10.1109/CCC.1997.612323","DOIUrl":"https://doi.org/10.1109/CCC.1997.612323","url":null,"abstract":"This paper continues the work initiated by N. Creignou (1995) and S. Khanna et al. (1997) who classify maximization problems derived from Boolean constraint satisfaction. We study the approximability of minimization problems derived thence. A problem in this framework is characterized by a collection F of \"constraints\" (i.e., functions f: {0,1}/sup k//spl rarr/{0,1}) and an instance of a problem is constraints drawn from F applied to specified subsets of n Boolean variables. We study the two minimization analogs of classes studied by S. Khanna et al.: in one variant, namely MIN CSP (F), the objective is to find an assignment to minimize the number of unsatisfied constraints, while in the other namely MIN ONES (F), the goal is to find a satisfying assignment with minimum number of ones. These two classes together capture an entire spectrum of important minimization problems including s-t Min Cut, vertex cover hitting set with bounded size sets, integer programs with two variables per inequality graph bipartization, clause deletion in CNF formulae, and nearest codeword. Our main result is that there exists a finite partition of the space of all constraint sets such that for any given F, the approximability of MIN CSP (F) and MIN ONES (F) is completely determined by the partition containing it. Moreover we present a compact set of rules that determines which partition contains a given family F. Our classification identifies the central elements governing the approximability of problems in these classes, by unifying a large collection algorithmic and hardness of approximation results.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126611508","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}
{"title":"A nonadaptive NC checker for permutation group intersection","authors":"V. Arvind, J. Torán","doi":"10.1109/CCC.1997.612316","DOIUrl":"https://doi.org/10.1109/CCC.1997.612316","url":null,"abstract":"In this paper we design a nonadaptive NC checker for permutation group intersection, sharpening a result from M. Blum and S. Kannan (1995). This is a consequence of two results. First we show that a nontrivial permutation in the intersection of two given permutation groups (described by lists of generators) can be computed by an NC algorithm with one round of parallel queries to the group intersection problem. Next we design a two-round interactive proof system for the complement of the group intersection problem, for which the honest prover can be simulated by an NC algorithm with one round of parallel queries to group intersection. As a consequence we also have nonadaptive NC checkers for some related group-theoretic problems. On the technical side, we define a generalization of wreath products of permutation groups. This product plays a crucial role in the design of the nonadaptive checkers.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"197 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122522217","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}
Cristopher Moore, D. Thérien, F. Lemieux, Joshua Berman, Arthur A. Drisko
{"title":"Circuits and expressions with non-associative gates","authors":"Cristopher Moore, D. Thérien, F. Lemieux, Joshua Berman, Arthur A. Drisko","doi":"10.1109/CCC.1997.612315","DOIUrl":"https://doi.org/10.1109/CCC.1997.612315","url":null,"abstract":"We consider circuits and expressions whose gates carry out multiplication in a non-associative groupoid such as loop. We define a class we call the polyabelian groupoids, formed by iterated quasidirect products of Abelian groups. We show that a loop can express arbitrary Boolean functions if and only if it is not polyabelian, in which case its EXPRESSION EVALUATION and CIRCUIT VALUE problems are NC/sup 1/-complete and P-complete respectively. This is not true for groupoids in general, and we give a counter-example. We show that EXPRESSION EVALUATION is also NC/sup 1/-complete if the groupoid has a non-solvable multiplication semigroup, but is in TC/sup 0/ if the groupoid is both polyabelian and has a solvable multiplication semigroup. Thus, in the non-associative case, earlier results about the role of solvability in circuit complexity generalize in several different ways.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128109899","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}
{"title":"Polynomial vicinity circuits and nonlinear lower bounds","authors":"Kenneth W. Regan","doi":"10.1109/CCC.1997.612301","DOIUrl":"https://doi.org/10.1109/CCC.1997.612301","url":null,"abstract":"We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial in t of some degree k. We prove that such circuits require size /spl Omega/(n/sup 1+1/k//log n) to compute several natural families of functions, including sorting, finite field arithmetic, and the \"rigid linear transformations\" of L. Valiant (1977). Our proof develops a \"separator theorem\" in the style of R. Lipton and R. Tarjan (1979) for a new class of graphs, and our methods may have independent graph-theoretic interest.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"35 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123613954","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}
{"title":"Acceptance by transformation monoids (with an application to local self reductions)","authors":"U. Hertrampf","doi":"10.1109/CCC.1997.612317","DOIUrl":"https://doi.org/10.1109/CCC.1997.612317","url":null,"abstract":"We study the power of transformation monoids, which are used as an acceptance mechanism of nondeterministic polynomial time machines. Focussing our attention on four types of transformation monoids (including the monoids of all transformations on k elements) we obtain exact characterizations of all investigated polynomial time classes. We apply these results to the cases of locally self reducible sets and of bottleneck Turing machines to obtain complete solutions to the formerly open problems related to these models. Especially, the complexity of k-locally self reducible sets for all numbers k, as well as the complexity of width-3 or width-4 bottleneck Turing machines are determined completely. Also for m-k-locally self reducible sets (i.e. k-locally self reducible sets, where the self reduction is given by a many-one reduction function) we determine the complexity exactly for all k.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128985068","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}
{"title":"Undecidability results for low complexity degree structures","authors":"R. Downey, A. Nies","doi":"10.1109/CCC.1997.612308","DOIUrl":"https://doi.org/10.1109/CCC.1997.612308","url":null,"abstract":"We prove that the theory of EXPTIME degrees with respect to polynomial time Turing and many-one reducibility is undecidable. To do so we use a coding method based on ideal lattices of Boolean algebras which is introduced A. Nies. The method can be applied in fact to all hyper-polynomial time classes.","PeriodicalId":358093,"journal":{"name":"Proceedings of Computational Complexity. Twelfth Annual IEEE Conference","volume":"153 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1997-06-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127418406","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}