On the complexity of approximate multivariate integration
|
|
- Sharyl Norris
- 5 years ago
- Views:
Transcription
1 On the complexity of approximate multivariate integration Ioannis Koutis Computer Science Department Carnegie Mellon University Pittsburgh, PA USA January 11, 2005 Abstract We consider the integration problem for the class of smooth positive functions in n variables. An approximation scheme for this problem was given by Applegate and Kannan [proc. of the 23 rd ACM Symposium on Theory of Computing]. For any given function f, the complexity of the algorithm is polynomial when f is O(log n)-far from log-concavity. Somewhat informally, this holds if for any one-dimensional projection of log f, there is a function g with g = O(log n), such that log f + g is concave. In this paper we show that a polynomial time algorithm for functions that are Ω(log 3 n)-far from log-concavity, implies a 2 o(n) algorithm for the Hamiltonian path problem for graphs with n vertices. In addition, we show that in the general case, for any fixed natural k, it is NP-hard to approximate the integral within a factor of 2 nk. 1 Introduction Suppose F ( ) is a real positive function defined on a cube C in Euclidean n-space R n. We consider the problem of approximating the integral I(F ) of F over C with relative error ɛ, under the additional assumption that F satisfies a smoothness condition. The exact integration of a multivariate function is hard, under the conjectured hardness of #P, given the result in [2], which implies that the exact computation of the volume of an n-dimensional polytope is #P-complete. In view of this, it is natural to ask whether there is an algorithm that returns an ɛ-approximation of I(F ), in other words a value V such that 1/(1 + ɛ) I(F )/V < (1 + ɛ). 1 This paper improves on a preliminary version that appeared in the 6 th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems. 1
2 The first somewhat surprising answer to this question, came with the major result of Dyer, Frieze and Kannan, who gave a fully polynomial randomized approximation scheme (FPRAS) for the volume of n-dimensional convex bodies [4]. More precisely, they showed that the volume of an n-dimensional convex body K defined by a weak membership oracle M, can be ɛ-approximated with failure probability ξ, with poly(n, ɛ 1, log ξ 1 ) calls to M. Here, M can be thought of as a black-box algorithm that answers in one step whether a given point is in K. This directly implies that there is a FPRAS for the integration of n-variate concave functions which can be evaluated in time poly(n) at any point in the cube C. Subsequently, Applegate and Kannan extended this result to positive smooth and nearly log-concave functions [1]. To be more precise, if we define f(x) = ln F (x), c be the edge length of C, t(n) be an upper bound on the time to evaluate F at any point in C, and α, β satisfying ( ) f(x) f(y) α max x i y i i [1,n] f(λx + (1 λ)y) λf(x) + (1 λ)f(y) β for all x, y C and λ [0, 1], their algorithm has running time O(t(n) n7 c 2 α 2 e 2β log n cαn log ). ɛ 2 ξ ɛ It can be seen that α measures the smoothness of F. Also, if β = 0, the function is logconcave, so β can be seen as a measure of the distance of F from log-concavity. The natural question then becomes whether the dependence on β can be removed or somewhat alleviated. The first contribution of this paper is the following theorem. Theorem 1.1. The integral of any n-variate, polynomial time computable, positive function cannot be 2 n -approximated in time O(poly(α, n)2õ(β1/3) ) (where õ suppresses lower order terms), unless the Hamiltonian path problem for n-vertex graphs has a 2 o(n) algorithm. It is known that the Hamiltonian path problem is hard for the class SNP under subexponential reductions [7]. Hence, a 2 o(n) algorithm would imply that the class SNP, which includes problems such as k-sat, Independent Set, or Set Cover, has subexponential algorithms. The second contribution of this paper is the following theorem. Theorem 1.2. For any fixed natural k it is NP-hard to 2 nk -approximate the integral of positive, polynomial time computable functions, that are smooth in the sense that α = poly(n). Incidentally, we obtain a new proof of the #P-hardness of the 1/n!-approximate integration. We note that in general, only a few negative results concerning the inapproximability of counting problems are known. As observed in [5], the hardness of counting problems in 2
3 most cases follows either from the NP-completeness of the corresponding decision problem, or from applying some boosting technique which exploits some embedded NP-complete problem. There appears to be a paucity of results that prove the hardness of an approximate counting problem modulo a plausible complexity-theoretic hypothesis. One such case is [3], which proves that there is no FPRAS for counting the number of independent sets in graphs of maximum degree greater than 25, unless NP = RP. As noted in [6], in view of the lack of such satisfactory results, research efforts have often been directed towards proving that certain restricted algorithmic approaches fail (see Section 4 of [6] and the references therein). 2 An outline of the proof technique We derive the result through a reduction from the Hamiltonian path problem (HP for short). Recall that HP is one of the first problems shown to be NP-complete [8]. Given a graph G (in some usual representation) HP asks whether there exists a path of length n that goes exactly one time through every vertex of G. With every graph G, we associate a function F G. If G has n vertices, F G is a function of n log n variables. The function F G has the the following useful characteristics. It can be computed at any point x in a cube C of interest, in time polynomial in n. The parameters α, β of F G (defined in the introduction), are polynomial in n. Also, the value of the integral of F G depends on whether G contains a Hamilton path or not. Specifically, if there is a HP, the integral of F G over a cube C of constant edge size c, is lower bounded by a explicitly known quantity I H. If not, it is upper bounded by I NH, with I H /I NH 2 nk, for any fixed constant k. This proves Theorem 1.2. When k = 1, we additionally have β = O(n 3 log 5 n), which proves Theorem 1.1. In fact, we show that if #HP denotes the number of Hamiltonian paths in G, the integral satisfies (#HP )I H I(F ) (#HP )I H + I NH. Since there are at most n! Hamiltonian paths, it easily follows that computing the integral within a factor of 1 + 1/n!, allows the computation of #HP. Since the problem of counting the Hamiltonian paths is #P-complete [10], this provides a proof of the #P-hardness of the 1/n!-approximate integration. 3 The proof 3.1 Definition and properties of the function F G Let G be a graph with n vertices, and P be the set of length-n paths of G. We will assume without loss of generality that n is a power of 2, and that the vertices are arbitrarily numbered with numbers in [n]. The function F G (X) is a function of n log n variables, X = {x 1,1, x 1,2,..., x n,log n }. The reader can think of {x i,1,..., x i,log n } as the set of variables used by node i. Each path p P is associated with a term f p (X), and F G (X) = p P f p(x). 3
4 We now describe the term f p (X) for a path p. We consider p as an ordered set of vertices v 1,..., v n, where v i [n]. For any integer i n, we let w(i) be the set of the positions of ones in the binary representation of i and z(i) = [log n] w(i). We let m = m(n), a polynomially bounded function to be discussed later. We define n f p (X) = g i,p (X) with g i,p (X) = i=1 j w(i) xm v i,j j z(i) xm v i,j Let us give a small example to illustrate the construction. Suppose n = 4, and let p 1 = {1, 2, 3, 4} and p 2 = {1, 2, 1, 4}. We have f p1 (X) = f p2 (X) = 1 x m 1,1x m 1,2 1 x m 1,1x m 1,2 xm 2,1 xm 3,2 x m x m 2,2 x 4,1x m m 4,2 3,1 xm 2,1 xm 1,2 x m x m 2,2 x 4,1x m m 4,2 1,1 The first thing to observe is that by the symmetry in the construction, for any f p, the total degree of the numerator is equal to the total degree of the denominator. More importantly, note that in f p2, x m 1,2 appears both in the numerator and the denominator. In contrast, there is no cancellation of monomials in f p1. These observations hold in general. Let p be any non-simple path, and assume a node v appears in the j th and k th positions of p. The binary representations of j and k differ in at least one bit, let this be the t th bit. Then, by construction, x m v,t appears in the numerator of g j,p and in the denominator of g k,p (or vice versa), and so we get a cancellation. On the other hand, if p is a simple path, there is no cancellation of monomials, since each g i,p uses a different subset of the variables. We will integrate F G over the cube C = [1, c] n log n, so we study its properties in this cube. Each term f p (X) is increasing in the variables appearing in the numerator and decreasing in the variables appearing in the denominator. By setting the former to c and the latter to 1, we get that the maximum value of f p (X) is O(c nm log n ). Since there are at most n! paths, it follows that for any X C, F G (X) can be expressed with O(mn 2 log 2 n) bits. As noted in [1], the smoothness parameter α, can be upper bounded by α n log n max,x i X ln F (X) x i = n log n max p P f p(x)/ x i,x i X p P f p(x) Let x i X be any variable. Then, since the exponent of x i is at most nm, for all points X in C, we have f p (X) x nmf p (X) 4 (1)
5 which combined with inequality 1, gives α n 2 m log n. The definition of β trivially implies that any upper bound for f(x) is also an upper bound for β. From the above analysis we get β O(mn 2 log 2 n). A note about the algorithm of [1] is due here. The algorithm operates on a grid imposed on C. The coordinates of the grid are multiples of γ 1/2α. From the bound on α it follows that we are interested in evaluating F G at points which are rationals that are expressible in polynomial space. From the definition of F G, its value at any point of the grid, is also a rational expressible in polynomial space. We finally note that F G (X) has some additional interesting properties. First, F G has derivatives of any order, everywhere in the cube C. Also, its form is relatively simple, as it is a sum of rational multivariate polynomials. In addition, given a graph G we can easily obtain a closed form for the integral of F G, of exponential length though. 3.2 A polynomial time algorithm to evaluate F G We give an algorithm that computes F G (X) at any point X, in n time steps. We extend the definition of the path terms, to paths of length t. Concretely, we let t f p (X) = g i,p (X) with g i,p (X) = i=1 j w(i) xm v i,j j z(i) xm v i,j Let P t (v) be the set of paths of length t, that end in node v. Inductively, assume that just before time step t, for every v V, we have computed Q t 1 (v) = f p (X) p P t 1 (v) Let N(v) denote the set of neighbors of node v. At step t, for each node v we compute j w(t) Q t (v) = xm v,j Q t 1 (v ) j z(t) xm v,j v N(v) After n steps the quantities Q n (v) have been computed for all vertices v V. Then, F G (X) = v V Q n (v) The computation of Q t (v) is performed with a polynomial number of operations. Since there are n steps and n vertices, it follows that F G can be computed with a polynomial number of operations. The points we are interested in are rationals that can be expressed in polynomial space, and from the observations of the previous subsection all the intermediate quantities can be expressed in polynomial space. It follows that F G (X) can be evaluated exactly, at any point X C, in time polynomial in n. 5
6 3.3 Bounding the integrals Recall that we integrate F (X) over a cube C = [1, c] n log n. Let dx = dx 1,1... dx n,log n and π be an arbitrary permutation of the variable names. Since f p (X)dX = f p (X)dX p P p P we can consider the integral of each path separately. We will refer to the value of the integral of a term corresponding to a path p as the integral of p. Also, since f p (x 1,..., x n,log n )dx = f p (π(x 1 ),..., π(x n,log n )) dx we can rename the variables in any term of F. It is then easy to see that the integral of a path depends only on the structure of the path and not on the particular vertices appearing on it. In the rest of the chapter we rename the variables, by letting X = {x 1, x 2,..., x nlog n }. We first consider the integral of a Hamiltonian path. Using the fact that there are no cancellations of monomials we have (n log n)/2 n log n I H = 1 dx = i=1 x m i j=(n log n)/2+1 = (m + 1) (n log n)/2 (m 1) (n log n)/2 (1 c m+1 ) (n log n)/2 (c m+1 (n log n)/2 1) x m j Let us now consider the integral of an arbitrary non-simple path p. As noted in Section 3.1, we get at least one cancellation of monomials in f p (X). In general, we have X = X 0 X 1 X 2, where X 0 is the set of variables that do not appear in f p, X 1 is the set of variables that contribute monomials of negative degree, and X 2 is the set of variables that contribute monomials of positive degree. We have f p (X) = g 1 (X 1 )g 2 (X 2 ), and thus I(f p ) = dx 0 g 1 (X 1 )dx 1 g 2 (X 2 )dx 2 X 0 C X 1 C X 2 C It is not hard to see that we have dx 0 (c 1) n log n X 0 C and X 1 C g 1 (X 1 )dx 1 < 1 Because of the cancellation, and using the fact that the total degrees of the nominator and the denominator are equal in f p (X), we have g 2 (X) = x ajm j x j X 2 where a j (n log n)/2 1 j 6
7 By integrating, we get X 2 g 2 (X 2 )dx 2 j ( c a j m+1 1 ) j ( c a j m+1 ) c (n log n)/2 c j a jm c (n log n)/2 c m(n log n)/2 c m Now suppose that G is not Hamiltonian. Since there are at most n n c n log n paths in the graph, the integral of the associated function is bounded above by I NH c 2n log n c (mn log n)/2 c m On the other hand, if G has #HP Hamiltonian paths then the integral satisfies For m = Ω(n log n), we asymptotically have, (#HP )I H I(F ) (#HP )I H + I NH I H (m + 1) n log n c (n log n)/2 (mn log n)/2 c We assume that m is polynomially bounded and thus m = o(c log2 n ) and (m + 1) n log n c n log3 n. This asymptotically gives the following gap I H I NH c m n log3 n By taking m = n k = Ω(n log n) be any fixed polynomial, Theorem 1.2 is proved. By taking m = 2n log 3 n the ratio is greater than 2 n, and also b = O(n 3 log 5 n). Thus, Theorem 1.1 follows. 4 Conclusions We showed that for any fixed natural k, it is NP-hard to 2 nk -approximate the integral of n- variate positive smooth functions. We also argued that the currently best known integration algorithm cannot be improved significantly, unless the class SNP, which includes several well studied NP-complete problems, has algorithms that break the currently known strongly exponential upper bounds. We wish to note that at the heart of our proof lies an attempt to algebraically isolate the term corresponding to the Hamiltonian path, based only on the fact that it is a simple path. In [9], Valiant suggested that any proof of a lower bound for NP should be preceded by explaining the failure of similar restricted algebraic approaches. In this sense, we feel that the most interesting question left open in this paper, is whether we can show a lower bound on the parameter β for all the polynomial (or more generally subexponential) time computable functions F G which can be constructed using the techniques of this paper. That would prove that the algorithmic approach underlying our proof fails entirely, and would also provide a partial answer to Valiant s question. 7
8 References [1] David Applegate and Ravi Kannan. Sampling and integration of near log-concave functions. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, [2] Graham Brightwell and Peter Winkler. Counting linear extensions is #P-complete. In Proceedings of the 23th Annual ACM Symposium on Theory of Computing, [3] Martin Dyer, Alan Frieze, and Mark Jerrum. On counting independent sets in graphs. In Proceedings of the 40nd Annual Symposium on the Foundations of Computer Science, [4] Martin Dyer, Alan Frieze, and Ravi Kannan. A random polynomial-time algorithm for approximating the volume of convex bodies. Journal of the ACM, 38:1 17, [5] Martin Dyer, Leslie Ann Goldberg, Catherine Greenhill, and Mark Jerrum. On the relative complxity of approximate counting problems. Algorithmica, to appear. [6] Martin Dyer and Catherine Greenhill. Random walks on combinatorial objects. Surveys in Combinatorics, 267: , [7] R. Impagliazzo, R. Paturi, and F. Zane. Which problems have strongly exponential complexity? In Proceedings of the 39th Annual Symposium on Foundations of Computer Science, page 653. IEEE Computer Society, [8] Richard M. Karp. Reducibility among combinatorial problems. In R. E. Miller and J. W. Thatcher, editors, Complexity of Computer Computations, pages Plenum Press, [9] Leslie G. Valiant. Why is boolean complexity difficult? Boolean Function Complexity, Lond. Math. Soc. Lecure Note Ser., 169. [10] Leslie G. Valiant. The complexity of enumeration and reliability problems. SIAM Journal of Computing, 8(3): ,
Sampling Contingency Tables
Sampling Contingency Tables Martin Dyer Ravi Kannan John Mount February 3, 995 Introduction Given positive integers and, let be the set of arrays with nonnegative integer entries and row sums respectively
More informationLecture 21: Counting and Sampling Problems
princeton univ. F 14 cos 521: Advanced Algorithm Design Lecture 21: Counting and Sampling Problems Lecturer: Sanjeev Arora Scribe: Today s topic of counting and sampling problems is motivated by computational
More informationU.C. Berkeley CS278: Computational Complexity Professor Luca Trevisan August 30, Notes for Lecture 1
U.C. Berkeley CS278: Computational Complexity Handout N1 Professor Luca Trevisan August 30, 2004 Notes for Lecture 1 This course assumes CS170, or equivalent, as a prerequisite. We will assume that the
More informationBounds for pairs in partitions of graphs
Bounds for pairs in partitions of graphs Jie Ma Xingxing Yu School of Mathematics Georgia Institute of Technology Atlanta, GA 30332-0160, USA Abstract In this paper we study the following problem of Bollobás
More informationIrredundant Families of Subcubes
Irredundant Families of Subcubes David Ellis January 2010 Abstract We consider the problem of finding the maximum possible size of a family of -dimensional subcubes of the n-cube {0, 1} n, none of which
More informationCounting bases of representable matroids
Counting bases of representable matroids Michael Snook School of Mathematics, Statistics and Operations Research Victoria University of Wellington Wellington, New Zealand michael.snook@msor.vuw.ac.nz Submitted:
More informationLecture 17: D-Stable Polynomials and Lee-Yang Theorems
Counting and Sampling Fall 2017 Lecture 17: D-Stable Polynomials and Lee-Yang Theorems Lecturer: Shayan Oveis Gharan November 29th Disclaimer: These notes have not been subjected to the usual scrutiny
More informationCounting Linear Extensions of a Partial Order
Counting Linear Extensions of a Partial Order Seth Harris March 6, 20 Introduction A partially ordered set (P,
More informationLength-Increasing Reductions for PSPACE-Completeness
Length-Increasing Reductions for PSPACE-Completeness John M. Hitchcock 1 and A. Pavan 2 1 Department of Computer Science, University of Wyoming. jhitchco@cs.uwyo.edu 2 Department of Computer Science, Iowa
More informationLecture 6: Random Walks versus Independent Sampling
Spectral Graph Theory and Applications WS 011/01 Lecture 6: Random Walks versus Independent Sampling Lecturer: Thomas Sauerwald & He Sun For many problems it is necessary to draw samples from some distribution
More informationOn the Complexity of the Minimum Independent Set Partition Problem
On the Complexity of the Minimum Independent Set Partition Problem T-H. Hubert Chan 1, Charalampos Papamanthou 2, and Zhichao Zhao 1 1 Department of Computer Science the University of Hong Kong {hubert,zczhao}@cs.hku.hk
More information1 Review of Vertex Cover
CS266: Parameterized Algorithms and Complexity Stanford University Lecture 3 Tuesday, April 9 Scribe: Huacheng Yu Spring 2013 1 Review of Vertex Cover In the last lecture, we discussed FPT algorithms for
More informationNot all counting problems are efficiently approximable. We open with a simple example.
Chapter 7 Inapproximability Not all counting problems are efficiently approximable. We open with a simple example. Fact 7.1. Unless RP = NP there can be no FPRAS for the number of Hamilton cycles in a
More informationChapter 1 Preliminaries
Chapter 1 Preliminaries 1.1 Conventions and Notations Throughout the book we use the following notations for standard sets of numbers: N the set {1, 2,...} of natural numbers Z the set of integers Q the
More information6.1 Polynomial Functions
6.1 Polynomial Functions Definition. A polynomial function is any function p(x) of the form p(x) = p n x n + p n 1 x n 1 + + p 2 x 2 + p 1 x + p 0 where all of the exponents are non-negative integers and
More informationk-protected VERTICES IN BINARY SEARCH TREES
k-protected VERTICES IN BINARY SEARCH TREES MIKLÓS BÓNA Abstract. We show that for every k, the probability that a randomly selected vertex of a random binary search tree on n nodes is at distance k from
More informationConductance and Rapidly Mixing Markov Chains
Conductance and Rapidly Mixing Markov Chains Jamie King james.king@uwaterloo.ca March 26, 2003 Abstract Conductance is a measure of a Markov chain that quantifies its tendency to circulate around its states.
More informationThe Complexity of Computing the Sign of the Tutte Polynomial
The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint work with Mark Jerrum) Oxford Algorithms Workshop, October 2012 The Tutte polynomial of a graph G = (V,
More informationThe Tutte polynomial: sign and approximability
: sign and approximability Mark Jerrum School of Mathematical Sciences Queen Mary, University of London Joint work with Leslie Goldberg, Department of Computer Science, University of Oxford Durham 23rd
More informationOn the Sample Complexity of Noise-Tolerant Learning
On the Sample Complexity of Noise-Tolerant Learning Javed A. Aslam Department of Computer Science Dartmouth College Hanover, NH 03755 Scott E. Decatur Laboratory for Computer Science Massachusetts Institute
More informationSeparating Monotone VP and VNP
Electronic Colloquium on Computational Complexity, Report No. 124 (2018) Separating Monotone VP and VNP Amir Yehudayoff Abstract This work is about the monotone versions of the algebraic complexity classes
More informationHardness of the Covering Radius Problem on Lattices
Hardness of the Covering Radius Problem on Lattices Ishay Haviv Oded Regev June 6, 2006 Abstract We provide the first hardness result for the Covering Radius Problem on lattices (CRP). Namely, we show
More informationA Note on the Complexity of Network Reliability Problems. Hans L. Bodlaender Thomas Wolle
A Note on the Complexity of Network Reliability Problems Hans L. Bodlaender Thomas Wolle institute of information and computing sciences, utrecht university technical report UU-CS-2004-001 www.cs.uu.nl
More informationVALIANT S MODEL AND THE COST OF COMPUTING INTEGERS
comput. complex. 13 (2004), 131 146 1016-3328/04/030131 16 DOI 10.1007/s00037-004-0186-2 c Birkhäuser Verlag, Basel 2004 computational complexity VALIANT S MODEL AND THE COST OF COMPUTING INTEGERS Pascal
More informationOptimization of a Convex Program with a Polynomial Perturbation
Optimization of a Convex Program with a Polynomial Perturbation Ravi Kannan Microsoft Research Bangalore Luis Rademacher College of Computing Georgia Institute of Technology Abstract We consider the problem
More informationFine Grained Counting Complexity I
Fine Grained Counting Complexity I Holger Dell Saarland University and Cluster of Excellence (MMCI) & Simons Institute for the Theory of Computing 1 50 Shades of Fine-Grained #W[1] W[1] fixed-parameter
More informationLecture 6: September 22
CS294 Markov Chain Monte Carlo: Foundations & Applications Fall 2009 Lecture 6: September 22 Lecturer: Prof. Alistair Sinclair Scribes: Alistair Sinclair Disclaimer: These notes have not been subjected
More information1 Randomized Computation
CS 6743 Lecture 17 1 Fall 2007 1 Randomized Computation Why is randomness useful? Imagine you have a stack of bank notes, with very few counterfeit ones. You want to choose a genuine bank note to pay at
More informationLecture 22: Counting
CS 710: Complexity Theory 4/8/2010 Lecture 22: Counting Instructor: Dieter van Melkebeek Scribe: Phil Rydzewski & Chi Man Liu Last time we introduced extractors and discussed two methods to construct them.
More informationDRAFT. Algebraic computation models. Chapter 14
Chapter 14 Algebraic computation models Somewhat rough We think of numerical algorithms root-finding, gaussian elimination etc. as operating over R or C, even though the underlying representation of the
More informationCSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010
CSC 5170: Theory of Computational Complexity Lecture 5 The Chinese University of Hong Kong 8 February 2010 So far our notion of realistic computation has been completely deterministic: The Turing Machine
More informationSome Sieving Algorithms for Lattice Problems
Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp - Some Sieving Algorithms for Lattice Problems V. Arvind and Pushkar
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg) of edge-disjoint
More informationThe Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n^4) - Theory and Implementation
The Lovasz-Vempala algorithm for computing the volume of a convex body in O*(n^4) - Theory and Implementation Mittagsseminar, 20. Dec. 2011 Christian L. Müller, MOSAIC group, Institute of Theoretical Computer
More informationAn Introduction to Randomized algorithms
An Introduction to Randomized algorithms C.R. Subramanian The Institute of Mathematical Sciences, Chennai. Expository talk presented at the Research Promotion Workshop on Introduction to Geometric and
More informationAbstract. This paper discusses polynomial-time reductions from Hamiltonian Circuit (HC),
SAT-Variable Complexity of Hard Combinatorial Problems Kazuo Iwama and Shuichi Miyazaki Department of Computer Science and Communication Engineering Kyushu University, Hakozaki, Higashi-ku, Fukuoka 812,
More informationNotes for Lecture 2. Statement of the PCP Theorem and Constraint Satisfaction
U.C. Berkeley Handout N2 CS294: PCP and Hardness of Approximation January 23, 2006 Professor Luca Trevisan Scribe: Luca Trevisan Notes for Lecture 2 These notes are based on my survey paper [5]. L.T. Statement
More informationCSE200: Computability and complexity Space Complexity
CSE200: Computability and complexity Space Complexity Shachar Lovett January 29, 2018 1 Space complexity We would like to discuss languages that may be determined in sub-linear space. Lets first recall
More informationDecomposition of random graphs into complete bipartite graphs
Decomposition of random graphs into complete bipartite graphs Fan Chung Xing Peng Abstract We consider the problem of partitioning the edge set of a graph G into the minimum number τg of edge-disjoint
More informationApproximation Algorithms for Maximum. Coverage and Max Cut with Given Sizes of. Parts? A. A. Ageev and M. I. Sviridenko
Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts? A. A. Ageev and M. I. Sviridenko Sobolev Institute of Mathematics pr. Koptyuga 4, 630090, Novosibirsk, Russia fageev,svirg@math.nsc.ru
More informationHow many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected?
How many randomly colored edges make a randomly colored dense graph rainbow hamiltonian or rainbow connected? Michael Anastos and Alan Frieze February 1, 2018 Abstract In this paper we study the randomly
More informationNondeterminism LECTURE Nondeterminism as a proof system. University of California, Los Angeles CS 289A Communication Complexity
University of California, Los Angeles CS 289A Communication Complexity Instructor: Alexander Sherstov Scribe: Matt Brown Date: January 25, 2012 LECTURE 5 Nondeterminism In this lecture, we introduce nondeterministic
More informationConvex Optimization Notes
Convex Optimization Notes Jonathan Siegel January 2017 1 Convex Analysis This section is devoted to the study of convex functions f : B R {+ } and convex sets U B, for B a Banach space. The case of B =
More informationThe Complexity of Maximum. Matroid-Greedoid Intersection and. Weighted Greedoid Maximization
Department of Computer Science Series of Publications C Report C-2004-2 The Complexity of Maximum Matroid-Greedoid Intersection and Weighted Greedoid Maximization Taneli Mielikäinen Esko Ukkonen University
More informationc 2010 Society for Industrial and Applied Mathematics
SIAM J. DISCRETE MATH. Vol. 24, No. 3, pp. 1038 1045 c 2010 Society for Industrial and Applied Mathematics SET SYSTEMS WITHOUT A STRONG SIMPLEX TAO JIANG, OLEG PIKHURKO, AND ZELEALEM YILMA Abstract. A
More informationA Necessary Condition for Learning from Positive Examples
Machine Learning, 5, 101-113 (1990) 1990 Kluwer Academic Publishers. Manufactured in The Netherlands. A Necessary Condition for Learning from Positive Examples HAIM SHVAYTSER* (HAIM%SARNOFF@PRINCETON.EDU)
More informationApproximating Longest Directed Path
Electronic Colloquium on Computational Complexity, Report No. 3 (003) Approximating Longest Directed Path Andreas Björklund Thore Husfeldt Sanjeev Khanna April 6, 003 Abstract We investigate the hardness
More informationOn the mean connected induced subgraph order of cographs
AUSTRALASIAN JOURNAL OF COMBINATORICS Volume 71(1) (018), Pages 161 183 On the mean connected induced subgraph order of cographs Matthew E Kroeker Lucas Mol Ortrud R Oellermann University of Winnipeg Winnipeg,
More informationLecture 11 October 7, 2013
CS 4: Advanced Algorithms Fall 03 Prof. Jelani Nelson Lecture October 7, 03 Scribe: David Ding Overview In the last lecture we talked about set cover: Sets S,..., S m {,..., n}. S has cost c S. Goal: Cover
More informationRandomly coloring constant degree graphs
Randomly coloring constant degree graphs Martin Dyer Alan Frieze Thomas P. Hayes Eric Vigoda April 6, 2011 Abstract We study a simple Markov chain, known as the Glauber dynamics, for generating a random
More informationCOUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF
COUNTING NUMERICAL SEMIGROUPS BY GENUS AND SOME CASES OF A QUESTION OF WILF NATHAN KAPLAN Abstract. The genus of a numerical semigroup is the size of its complement. In this paper we will prove some results
More informationLimits of Functions (a, L)
Limits of Functions f(x) (a, L) L f(x) x a x x 20 Informal Definition: If the values of can be made as close to as we like by taking values of sufficiently close to [but not equal to ] then we write or
More informationITCS:CCT09 : Computational Complexity Theory Apr 8, Lecture 7
ITCS:CCT09 : Computational Complexity Theory Apr 8, 2009 Lecturer: Jayalal Sarma M.N. Lecture 7 Scribe: Shiteng Chen In this lecture, we will discuss one of the basic concepts in complexity theory; namely
More informationAdding random edges to create the square of a Hamilton cycle
Adding random edges to create the square of a Hamilton cycle Patrick Bennett Andrzej Dudek Alan Frieze October 7, 2017 Abstract We consider how many random edges need to be added to a graph of order n
More informationApproximate Counting and Markov Chain Monte Carlo
Approximate Counting and Markov Chain Monte Carlo A Randomized Approach Arindam Pal Department of Computer Science and Engineering Indian Institute of Technology Delhi March 18, 2011 April 8, 2011 Arindam
More informationfsat We next show that if sat P, then fsat has a polynomial-time algorithm. c 2010 Prof. Yuh-Dauh Lyuu, National Taiwan University Page 425
fsat fsat is this function problem: Let φ(x 1, x 2,..., x n ) be a boolean expression. If φ is satisfiable, then return a satisfying truth assignment. Otherwise, return no. We next show that if sat P,
More informationMonotone Submodular Maximization over a Matroid
Monotone Submodular Maximization over a Matroid Yuval Filmus January 31, 2013 Abstract In this talk, we survey some recent results on monotone submodular maximization over a matroid. The survey does not
More informationON TESTING HAMILTONICITY OF GRAPHS. Alexander Barvinok. July 15, 2014
ON TESTING HAMILTONICITY OF GRAPHS Alexander Barvinok July 5, 204 Abstract. Let us fix a function f(n) = o(nlnn) and reals 0 α < β. We present a polynomial time algorithm which, given a directed graph
More informationarxiv: v1 [cs.dm] 12 Jun 2016
A Simple Extension of Dirac s Theorem on Hamiltonicity Yasemin Büyükçolak a,, Didem Gözüpek b, Sibel Özkana, Mordechai Shalom c,d,1 a Department of Mathematics, Gebze Technical University, Kocaeli, Turkey
More informationPROBABILISTIC ANALYSIS OF THE GENERALISED ASSIGNMENT PROBLEM
PROBABILISTIC ANALYSIS OF THE GENERALISED ASSIGNMENT PROBLEM Martin Dyer School of Computer Studies, University of Leeds, Leeds, U.K. and Alan Frieze Department of Mathematics, Carnegie-Mellon University,
More informationAverage-case Analysis for Combinatorial Problems,
Average-case Analysis for Combinatorial Problems, with s and Stochastic Spanning Trees Mathematical Sciences, Carnegie Mellon University February 2, 2006 Outline Introduction 1 Introduction Combinatorial
More informationQuestionnaire for CSET Mathematics subset 1
Questionnaire for CSET Mathematics subset 1 Below is a preliminary questionnaire aimed at finding out your current readiness for the CSET Math subset 1 exam. This will serve as a baseline indicator for
More informationConvex and Semidefinite Programming for Approximation
Convex and Semidefinite Programming for Approximation We have seen linear programming based methods to solve NP-hard problems. One perspective on this is that linear programming is a meta-method since
More informationConnections between exponential time and polynomial time problem Lecture Notes for CS294
Connections between exponential time and polynomial time problem Lecture Notes for CS294 Lecturer: Russell Impagliazzo Scribe: Stefan Schneider November 10, 2015 We connect problems that have exponential
More informationA Duality between Clause Width and Clause Density for SAT
A Duality between Clause Width and Clause Density for SAT Chris Calabro, Russell Impagliazzo, Ramamohan Paturi University of California, San Diego 9500 Gilman Drive, La Jolla, CA 92093 ccalabro,russell,paturi
More informationRainbow Hamilton cycles in uniform hypergraphs
Rainbow Hamilton cycles in uniform hypergraphs Andrzej Dude Department of Mathematics Western Michigan University Kalamazoo, MI andrzej.dude@wmich.edu Alan Frieze Department of Mathematical Sciences Carnegie
More informationNew lower bounds for hypergraph Ramsey numbers
New lower bounds for hypergraph Ramsey numbers Dhruv Mubayi Andrew Suk Abstract The Ramsey number r k (s, n) is the minimum N such that for every red-blue coloring of the k-tuples of {1,..., N}, there
More informationTheory of Computer Science to Msc Students, Spring Lecture 2
Theory of Computer Science to Msc Students, Spring 2007 Lecture 2 Lecturer: Dorit Aharonov Scribe: Bar Shalem and Amitai Gilad Revised: Shahar Dobzinski, March 2007 1 BPP and NP The theory of computer
More informationCOMP Analysis of Algorithms & Data Structures
COMP 3170 - Analysis of Algorithms & Data Structures Shahin Kamali Computational Complexity CLRS 34.1-34.4 University of Manitoba COMP 3170 - Analysis of Algorithms & Data Structures 1 / 50 Polynomial
More informationFPT hardness for Clique and Set Cover with super exponential time in k
FPT hardness for Clique and Set Cover with super exponential time in k Mohammad T. Hajiaghayi Rohit Khandekar Guy Kortsarz Abstract We give FPT-hardness for setcover and clique with super exponential time
More information(x 1 +x 2 )(x 1 x 2 )+(x 2 +x 3 )(x 2 x 3 )+(x 3 +x 1 )(x 3 x 1 ).
CMPSCI611: Verifying Polynomial Identities Lecture 13 Here is a problem that has a polynomial-time randomized solution, but so far no poly-time deterministic solution. Let F be any field and let Q(x 1,...,
More informationNotes 6 : First and second moment methods
Notes 6 : First and second moment methods Math 733-734: Theory of Probability Lecturer: Sebastien Roch References: [Roc, Sections 2.1-2.3]. Recall: THM 6.1 (Markov s inequality) Let X be a non-negative
More information10.4 The Kruskal Katona theorem
104 The Krusal Katona theorem 141 Example 1013 (Maximum weight traveling salesman problem We are given a complete directed graph with non-negative weights on edges, and we must find a maximum weight Hamiltonian
More informationPolynomial-time counting and sampling of two-rowed contingency tables
Polynomial-time counting and sampling of two-rowed contingency tables Martin Dyer and Catherine Greenhill School of Computer Studies University of Leeds Leeds LS2 9JT UNITED KINGDOM Abstract In this paper
More informationEconomics 204 Fall 2011 Problem Set 1 Suggested Solutions
Economics 204 Fall 2011 Problem Set 1 Suggested Solutions 1. Suppose k is a positive integer. Use induction to prove the following two statements. (a) For all n N 0, the inequality (k 2 + n)! k 2n holds.
More informationOn Symmetric Signatures in Holographic Algorithms. Jin-Yi Cai University of Wisconsin, Madison. Pinyan Lu Tsinghua University, Beijing
On Symmetric Signatures in Holographic Algorithms Jin-Yi Cai University of Wisconsin, Madison Pinyan Lu Tsinghua University, Beijing NSF CCR-0208013 and CCR-0511679. 1 #P Counting problems: #SAT: How many
More informationACO Comprehensive Exam October 14 and 15, 2013
1. Computability, Complexity and Algorithms (a) Let G be the complete graph on n vertices, and let c : V (G) V (G) [0, ) be a symmetric cost function. Consider the following closest point heuristic for
More informationON SENSITIVITY OF k-uniform HYPERGRAPH PROPERTIES
ON SENSITIVITY OF k-uniform HYPERGRAPH PROPERTIES JOSHUA BIDERMAN, KEVIN CUDDY, ANG LI, MIN JAE SONG Abstract. In this paper we present a graph property with sensitivity Θ( n), where n = ( v 2) is the
More informationNear-Optimal Algorithms for Maximum Constraint Satisfaction Problems
Near-Optimal Algorithms for Maximum Constraint Satisfaction Problems Moses Charikar Konstantin Makarychev Yury Makarychev Princeton University Abstract In this paper we present approximation algorithms
More informationEssential facts about NP-completeness:
CMPSCI611: NP Completeness Lecture 17 Essential facts about NP-completeness: Any NP-complete problem can be solved by a simple, but exponentially slow algorithm. We don t have polynomial-time solutions
More information1 Agenda. 2 History. 3 Probabilistically Checkable Proofs (PCPs). Lecture Notes Definitions. PCPs. Approximation Algorithms.
CS 221: Computational Complexity Prof. Salil Vadhan Lecture Notes 20 April 12, 2010 Scribe: Jonathan Pines 1 Agenda. PCPs. Approximation Algorithms. PCPs = Inapproximability. 2 History. First, some history
More informationRational exponents in extremal graph theory
Rational exponents in extremal graph theory Boris Bukh David Conlon Abstract Given a family of graphs H, the extremal number ex(n, H) is the largest m for which there exists a graph with n vertices and
More informationLecture 15 - NP Completeness 1
CME 305: Discrete Mathematics and Algorithms Instructor: Professor Aaron Sidford (sidford@stanford.edu) February 29, 2018 Lecture 15 - NP Completeness 1 In the last lecture we discussed how to provide
More informationCSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010
CSC 5170: Theory of Computational Complexity Lecture 4 The Chinese University of Hong Kong 1 February 2010 Computational complexity studies the amount of resources necessary to perform given computations.
More informationGame Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems
Game Theory and Algorithms Lecture 7: PPAD and Fixed-Point Theorems March 17, 2011 Summary: The ultimate goal of this lecture is to finally prove Nash s theorem. First, we introduce and prove Sperner s
More informationBackground on Coherent Systems
2 Background on Coherent Systems 2.1 Basic Ideas We will use the term system quite freely and regularly, even though it will remain an undefined term throughout this monograph. As we all have some experience
More informationLecture 19 : Reed-Muller, Concatenation Codes & Decoding problem
IITM-CS6845: Theory Toolkit February 08, 2012 Lecture 19 : Reed-Muller, Concatenation Codes & Decoding problem Lecturer: Jayalal Sarma Scribe: Dinesh K Theme: Error correcting codes In the previous lecture,
More informationThe Complexity of the Permanent and Related Problems
The Complexity of the Permanent and Related Problems Tim Abbott and Alex Schwendner May 9, 2007 Contents 1 The Permanent 2 1.1 Variations on the Determinant...................... 2 1.2 Graph Interpretation...........................
More informationWorst Case Performance of Approximation Algorithm for Asymmetric TSP
Worst Case Performance of Approximation Algorithm for Asymmetric TSP Anna Palbom Department of Numerical Analysis and Computer Science Royal Institute of Technology S-100 44 Stockholm, Sweden E-mail: annap@nada.kth.se
More informationW -Hardness under Linear FPT-Reductions: Structural Properties and Further Applications
W -Hardness under Linear FPT-Reductions: Structural Properties and Further Applications Jianer Chen 1 Xiuzhen Huang 2 Iyad A. Kanj 3 Ge Xia 4 1 Dept. of Computer Science, Texas A&M University, College
More informationMin-Wise independent linear permutations
Min-Wise independent linear permutations Tom Bohman Department of Mathematical Sciences, Carnegie Mellon University, Pittsburgh PA523, USA E-mail:tbohman@andrewcmuedu Colin Cooper School of Mathematical
More informationModel Counting for Logical Theories
Model Counting for Logical Theories Wednesday Dmitry Chistikov Rayna Dimitrova Department of Computer Science University of Oxford, UK Max Planck Institute for Software Systems (MPI-SWS) Kaiserslautern
More informationMinimum-Dilation Tour (and Path) is NP-hard
Minimum-Dilation Tour (and Path) is NP-hard Panos Giannopoulos Christian Knauer Dániel Marx Abstract We prove that computing a minimum-dilation (Euclidean) Hamilton circuit or path on a given set of points
More informationDRAFT. Complexity of counting. Chapter 8
Chapter 8 Complexity of counting It is an empirical fact that for many combinatorial problems the detection of the existence of a solution is easy, yet no computationally efficient method is known for
More informationAlgebra 2: Semester 2 Practice Final Unofficial Worked Out Solutions by Earl Whitney
Algebra 2: Semester 2 Practice Final Unofficial Worked Out Solutions by Earl Whitney 1. The key to this problem is recognizing cubes as factors in the radicands. 24 16 5 2. The key to this problem is recognizing
More informationBasic counting techniques. Periklis A. Papakonstantinou Rutgers Business School
Basic counting techniques Periklis A. Papakonstantinou Rutgers Business School i LECTURE NOTES IN Elementary counting methods Periklis A. Papakonstantinou MSIS, Rutgers Business School ALL RIGHTS RESERVED
More informationMATHEMATICS Trigonometry. Mathematics 30-1 Mathematics (10 12) /21 Alberta Education, Alberta, Canada (2008)
MATHEMATICS 30-1 [C] Communication Trigonometry Develop trigonometric reasoning. 1. Demonstrate an understanding of angles in standard position, expressed in degrees and radians. [CN, ME, R, V] 2. Develop
More informationLecture 16: Roots of the Matching Polynomial
Counting and Sampling Fall 2017 Lecture 16: Roots of the Matching Polynomial Lecturer: Shayan Oveis Gharan November 22nd Disclaimer: These notes have not been subjected to the usual scrutiny reserved for
More informationarxiv: v2 [cs.ds] 3 Oct 2017
Orthogonal Vectors Indexing Isaac Goldstein 1, Moshe Lewenstein 1, and Ely Porat 1 1 Bar-Ilan University, Ramat Gan, Israel {goldshi,moshe,porately}@cs.biu.ac.il arxiv:1710.00586v2 [cs.ds] 3 Oct 2017 Abstract
More informationImproved Bounds for Flow Shop Scheduling
Improved Bounds for Flow Shop Scheduling Monaldo Mastrolilli and Ola Svensson IDSIA - Switzerland. {monaldo,ola}@idsia.ch Abstract. We resolve an open question raised by Feige & Scheideler by showing that
More information