Dimension Characterizations of Complexity Classes
|
|
- Clifford Randall
- 5 years ago
- Views:
Transcription
1 Dimension Characterizations of Comlexity Classes Xiaoyang Gu Jack H. Lutz Abstract We use derandomization to show that sequences of ositive sace-dimension in fact, even ositive k-dimension for suitable k have, for many uroses, the full ower of random oracles. For examle, we show that, if S is any binary sequence whose 3-dimension is ositive, then BPP P S and, moreover, every BPP romise roblem is P S -searable. We rove analogous results at higher levels of the olynomial-time hierarchy. The dimension-almost-class of a comlexity class C, denoted by dimalmost-c, is the class consisting of all roblems A such that A C S for all but a Hausdorff dimension 0 set of oracles S. Our results yield several characterizations of comlexity classes, such as BPP = dimalmost-p and AM = dimalmost-np, that refine reviously known results on almost-classes. They also yield results, such as Promise-BPP = almost-p-se = dimalmost-p-se, in which even the almost-class aears to be a new characterization. 1 Introduction Assessing the comutational ower of randomness is one of the most fundamental challenges facing comutational comlexity theory. Concrete questions involving the best algorithms for rimality testing, factoring, etc., are instances of this challenge, as are structural questions concerning BPP, AM, and other randomized comlexity classes. One aroach to studying the ower of a randomized comlexity class C is to address the following question: If C 0 is the nonrandomized version of C, then how weak an assumtion can we lace on an oracle S and still be assured that C C0 S? For examle, how weak an assumtion can we lace on an oracle S and still be assured that BPP P S? For this articular question, it was a result of folklore that BPP P S holds for every oracle S that is algorithmically random in the sense of Martin-Löf [22]; it was shown by Lutz [18] that BPP P S holds for every oracle S that is sace-random; and it was shown by Allender and Strauss [3] that BPP P S holds for every oracle S that is -random, or even random relative to a articular sublinear-time comlexity class. In this aer, we extend this line of inquiry by considering oracles S that have ositive dimension (a comlexity-theoretic analog of classical Hausdorff dimension [11, 8]) with resect to various resource bounds. Secifically, we rove that every oracle S that has ositive 3-dimension (hence every oracle S that has ositive sace-dimension) satisfies BPP P S. Our main theorem is a generalization of this fact that alies to randomized romise classes at various levels of the olynomial-time hierarchy. (Promise roblems were introduced by Grollman and Selman [10]. The randomized romise class Promise-BPP was introduced by Buhrman Deartment of Comuter Science, Iowa State University, Ames, IA 50011, USA. xiaoyang@cs.iastate.edu Deartment of Comuter Science, Iowa State University, Ames, IA 50011, USA. lutz@cs.iastate.edu Research suorted in art by National Science Foundation Grant
2 and Fortnow [6] and shown by Fortnow [9] to characterize a strength level of derandomization hyotheses. The randomized romise class Promise-AM was introduced by Moser [25].) For every integer k 0, our main theorem says that, for every oracle S with ositive k+3-dimension, every BP Σ P k romise roblem is ΣP,S k -searable. In articular, if S has ositive 3-dimension, then every BPP romise roblem is P S -searable, and, if S has ositive 4-dimension, then every AM romise roblem is NP S -searable. We use our results to investigate classes of the form dimalmost-c = { A dim H ( { B A / C B } ) = 0 } for various comlexity classes C. It is clear that dimalmost-c is contained in the extensively investigated class almost-c = { A Pr[A / C B ] = 0 }, where the robability is comuted according to the uniform distribution (Lebesgue measure) on the set of all oracles B. We show that dimalmost-σ P k -Se = almost-σp k -Se = Promise-BP ΣP k holds for every integer k 0, where Σ P k -Se is the set of all ΣP k -searable airs of languages. This imlies that dimalmost-p = BPP, refining the roof by Bennett and Gill [5] that almost-p = BPP. Also, for all k 1, dimalmost-σ P k = BP ΣP k, refining the roof by Nisan and Wigderson [26] that almost-σ P k = BP ΣP k. The 1997 derandomization method of Imagliazzo and Wigderson [16] is central to our arguments. 2 Resource-Bounded Dimension and Relativized Circuit Comlexity This section reviews and develos those asects of resource-bounded dimension and its relationshi to relativized circuit-size comlexity that are needed in this aer. It is convenient to use entroy rates as an intermediate ste in this develoment. 2.1 Resource-Bounded Dimension Resource-bounded dimension is an extension of classical Hausdorff dimension that imoses dimension structure on various comlexity classes. There are now several equivalent ways to formulate resource-bounded dimension. Here we sketch the elements of the original formulation that are useful in this aer. We work in the Cantor-sace C of all infinite binary sequences. Definition. ([19]). Let s [0, ). 1. An s-gale is a function d : {0, 1} [0, ) satisfying d(w) = 2 s [d(w0) + d(w1)] for all w {0, 1}. 2
3 2. An s-gale succeeds on a sequence S C if lim su d(s[0..n 1]) =, where S[0..n 1] denotes the n-bit refix of S. n 3. The success set of an s-gale d is S [d] = {S C d succeeds on S }. The following gale characterization of Hausdorff dimension is the key to resource-bounded dimension. In this aer we will use this characterization in lace of the original definition of Hausdorff dimension [11, 8], which we refrain from reeating here. Theorem 2.1. (Lutz [19]). The Hausdorff dimension of a set X C is dim H (X) = inf {s there is an s-gale d such that X S [d]}. To extend Hausdorff dimension to comlexity classes, we define a resource bound to be one of the following classes of functions. all = {f f : {0, 1} {0, 1} } = { f all f is comutable in n O(1) time } k = ΣP k 1 for k 2 sace = { f all f is comutable in n O(1) sace } Each of these resource bounds is associated with a result class R( ) defined as follows. R(all) = C R() = E = TIME(2 linear ) R( k ) = E k = EΣP k 1 R(sace) = ESPACE = SPACE(2 linear ) A real-valued function f : {0, 1} [0, ) is -comutable if there is a function ˆf : {0, 1} N Q such that ˆf (where the inut (w, r) {0, 1} N is suitably encoded with r in unary) and, for all w {0, 1} and r N, ˆf(w, r) f(w) 2 r. We now define resource-bounded dimension by imosing resource bounds on the gale characterization in Theorem 2.1. Definition. ([19]). Let be a resource bound, and let X C. (We identify each S X with the language whose characteristic sequence is S.) 1. The -dimension of X is (X) = inf {s there is a -comutable s-gale d such that X S [d]}. 2. The dimension of X in R( ) is dim(x R( )) = (X R( )). As shown in [19], these definitions endow the above-mentioned comlexity classes R( ) with dimension structure. In general, and dim(r( ) R( )) = 1. Also, 0 dim(x R( )) (X) 1, = (X) (X), e.g., dim sace (X) 3 (X). It is clear that dim all(x) = dim(x C) = dim H (X). 3
4 Our main results involve -dimensions of individual sequences S, by which we mean (S) = ({S}). We use the easily verified fact that, if is any of the countable resource bounds above, then dim H ({S (S) = 0}) = 0. (2.1) For more discussion, motivation, examles, and results, see [19, 14, 20, 12, 23]. 2.2 Entroy Rates We use a recent result of Hitchcock and Vinodchandran [15] relating entroy rates to dimension. Entroy rates were studied by Chomsky and Miller [7], Kuich [17], Staiger [27, 28], Hitchcock [12], and others. Definition. The entroy rate of a language A {0, 1} is where A =n = A {0, 1} n. H A = lim su n log A =n, n Definition. Let C be a class of languages, and let X C. The C-entroy rate of X is where H C (X) = inf { H A A C and X A i.o.}, A i.o. = {S C ( n)s[0..n 1] A}. The following result is a routine relativization of Theorem 5.5 of [15]. Theorem 2.2. (Hitchcock and Vinodchandran [15]). For all X C and k Z +, k+2 (X) H Σ P k (X). 2.3 Relativized Circuit-Size Comlexity Definition.1 [29]. For f : {0, 1} n {0, 1} and A {0, 1}, size A (f) is the minimum size of (i.e., number of wires in) an n-inut oracle circuit γ such that γ A comutes f. 2. For x {0, 1} and A {0, 1}, size A (x) = size A (f x ), where f x : {0, 1} log x {0, 1} is defined by { x[i] if 0 i < x f x (w i ) = 0 if i x, w 0,...,w 2 log x 1 lexicograhically enumerate {0, 1} log x, and x[i] is the ith bit of x. Lemma 2.3. For all A, S C, H NP A({S}) lim inf n size A (S[0..n 1])log n. n 4
5 Proof. Assume that α > β > lim inf n size A (S[0..n 1])log n. n It suffices to show that H NP A({S}) α. Let B be the set of all strings x such that size A (x) < β x log x. By standard circuit-counting arguments (e.g., see [21]), there is a constant c N such that, for all sufficiently large n, if we choose m N with 2 m 1 n < 2 m and write γ = 2 m n, so that β n log n = β γ2 m log(γ2 m ) βγ 2m m 1, then so ) βγ 2 B =n c (4eβγ m 2m m 1, m 1 ) log B =n log c + βγ (4eβγ 2m m 1 log 2m m 1 [ m = log c + βγ2 m log 4eβγ log(m 1) + m 1 m 1 αn, ] whence H B = lim su n log B =n n α. By our choice of β, S B i.o.. Since B NP A, it follows that H NP A({S}) α. Notation. For k N and x {0, 1}, we write size ΣP k (x) = size K k (x), where K k is the canonical Σ P k -comlete language [4]. By Theorem 2.2 and Lemma 2.3, we have the following. Theorem 2.4. For all S C and k N, size ΣP k (S[0..n 1]) (S) lim inf k+3 n n 3 Positive-Dimension Derandomization In order to state our main theorem, we review the notion of searability and give a formulation of Promise-BP-classes that is suitable for our uroses. Definition. Given a class C of languages, an ordered air A = (A +, A ) of (disjoint) languages is C-searable if there exists a language C C such that A + C and A C =. We write C-Se = { (A +, A ) (A +, A ) is C-searable }. 5
6 Definition. Fix a standard aring function, : {0, 1} {0, 1} {0, 1}. 1. A witness configuration is an ordered air B = (B, g) where B {0, 1} and g : N N. 2. Given a witness configuration B = (B, g), the B-critical event for a string x {0, 1} is the set { } B x = w {0, 1} g( x ) x, w B, interreted as an event in the samle sace {0, 1} g( x ) with the uniform robability measure. (That is, the robability of B x is Pr(B x ) = 2 g( x ) B x.) 3. Given a class C of languages, we define the class Promise-BP C to be the set of all ordered airs A = (A +, A ) of languages for which there is a witness configuration B = (B, q) with the following four roerties. (i) B C. (ii) q is a olynomial. (iii) For all x A +, Pr(B x ) 2 3. (iv) For all x A, Pr(B x ) 1 3. Note that Promise-BP is an oerator that mas a class C of languages to a class Promise-BP C of disjoint airs of languages. In articular, Promise-BP P = Promise-BPP is the class of BPP romise roblems investigated by Buhrman and Fortnow [6] and Moser [24], and Promise-BP NP = Promise-AM is the class of Arthur-Merlin romise roblems investigated by Moser [25]. The following result is the main theorem of this aer. Theorem 3.1. For every S C and k N, (S) > 0 = Promise-BP ΣP k+3 k ΣP,S k -Se. Before roving Theorem 3.1, we derive some of its consequences. First, the cases k = 0 and k = 1 are of articular interest: Corollary 3.2. For every S C, and 3 (S) > 0 = Promise-BPP PS -Se 4 (S) > 0 = Promise-AM NPS -Se. We next note that our results for romise roblems imly the corresonding results for decision roblems. (Note, however, that the results of Fortnow [9] suggest that the results on romise roblems are in some sense stronger.) 6
7 Corollary 3.3. For every S C and k N, In articular, and k+3 (S) > 0 = BP ΣP k ΣP,S k. 3 (S) > 0 = BPP PS (3.1) 4 (S) > 0 = AM NPS. (3.2) Intuitively, (3.1) says that even an oracle S with 3-dimension which need not be random relative to any reasonable distribution contains enough randomness to carry out a deterministic simulation of BPP. To ut the matter differently, to rove that P = BPP, we need only show how to disense with such an oracle S. As in section 1, for each relativizable comlexity class C (of languages or airs of languages), define the dimension-almost-class dimalmost-c = { A dim H ( { S A / C S } ) = 0 }, noting that this is contained in the reviously studied almost-class almost-c = { A Pr[A C S ] = 1 }, where the robability is comuted according to the uniform distribution (Lebesgue measure) on the set of all oracles S. Theorem 3.4. For every k N, dimalmost-σ P k -Se = almost-σp k -Se = Promise-BP ΣP k. Nisan and Wigderson s unconditional seudorandom generator for constant deth circuit is used in the roof for Theorem 3.4. We state it here. Theorem 3.5 (Nisan and Wigderson [26]). Let d Z +. There exists a function G NW : {0, 1} {0, 1} defined by a collection {G n : {0, 1} ln {0, 1} n } such that l n = O((log n) 2d+6 ), G n is comutable by a logsace uniform family of circuits of olynomial size and deth d+4, and for any circuit family {C n : {0, 1} n {0, 1}} of olynomial size and deth d, Pr[C n (x) = 1] Pr[C n (G n (y))] 1/n. Proof of Theorem 3.4. We only rove for k > 0, since when k = 0, the roof is easier. Since every set of Hausdorff dimension less than 1 has Lebesgue measure 0, it is clear that dimalmost-σ P k -Se almost-σ P k -Se. To see that almost-σ P k -Se Promise-BP ΣP k, we use Nisan and Wigderson s roof. Let A = (A +, A ) almost-σ P k -Se. Then by the Lebesgue density theorem, there exists ΣP k oracle machine N with time bound n m such that Pr R [N R searates A] 3/4. Note that when inut x is fixed and x = n, the comutation of N (x) may be reresented as a deth k +2 circuit of size 2 (k+1)nm with 2 (k+1)nm oracle queries as inut. This is a linear size (with resect to oracle inut length) deth k + 2 circuit. We can use Theorem 3.5 to derandomize the exonential number of queries on random oracle to n (2k+10)m random oracle queries. Let G NW be the Nisan-Wigderson seudorandom generator. Let l n = n (2k+10)m. Let N be the following oracle Turing machine. 7
8 inut x n = x inut s {0, 1} ln let R = G NW (s) simulates N R(x) outut the outut of the simulation For all x A +, Pr R [N R (x) = 1] 3/4. By the seudorandomness of G NW, then, Similarly, for all x A, Let Pr s {0,1} ln[n GNW (s) (x) = 1] 2/3. (3.3) Pr s {0,1} ln[n GNW (s) (x) = 1] 1/3. (3.4) B = { x, s N( x, s ) = 1}. It is clear that B Σ P k. Also by (3.3), for all x A+, and, by (3.4), for all x A, Pr(B x ) 2/3, Pr(B x ) 1/3. Then (B, n (2k+10)m ) is a witness configuration for A, hence A Promise-BP Σ P k. To see that Promise-BP Σ P k dimalmost-σp k -Se, let A Promise-BP ΣP k. Let { } X = S A / Σ PS k -Se. By Theorem 3.1, every element of X has k+3 -dimension 0. By (2.1), this imlies that dim H(X) = 0, whence A dimalmost-σ P k -Se. Corollary 3.6. For every k N, dimalmost-σ P k = BP ΣP k. In articular, and dimalmost-p = BPP (3.5) dimalmost-np = AM. (3.6) We now turn to the roof of Theorem 3.1. We use the following well-known derandomization theorem. Theorem 3.7 (Imagliazzo and Wigderson [16]). For each ɛ > 0, there exists constants c > c > 0 such that, for every A {0, 1} and integer n > 1, the following holds. If f : {0, 1} clog n {0, 1} is a Boolean function that cannot be comuted by an oracle circuit of size at most n cɛ relative to A, 8
9 then the generator G IW97 f : {0, 1} c log n {0, 1} n has the roerty that, for every oracle circuit γ with size at most n, Pr r Un [γ A (r) = 1] Pr x U c log n [γ A (G IW97 f (x)) = 1] < 1 n, where U m denotes {0, 1} m with the uniform robability measure. Proof of Theorem 3.1. We rove the theorem for k > 0, since when k = 0, the roof is easier. Assume that (S) = α > 0. It suffices to show that for every A Promise-BP ΣP k+3 k, A Σ P,S k -Se. Note that Promise-BP Σ P k does not have oracle access to S. So we actually rove A NP ΣP k 1,S -Se. By Theorem 2.4, we have size ΣP k (S[0..n 1]) > αn 2log n for all but finitely many n. Let A = (A +, A ) Promise-BP Σ k. There exists B ΣP k and olynomial q such that (B, q) is a witness configuration for A. Therefore, there exists olynomial-time oracle Turing machine M and olynomial such that, for all x A +, and, for all x A, Pr r [( w {0, 1} ( x ) )M ΣP k 1 (x, r, w) = 1] 2/3 Pr r [( w {0, 1} ( x ) )M ΣP k 1 (x, r, w) = 1] 1/3. Let n d be the uer bound of the running time of M on x of length n with r and w of corresonding lengths. Let ɛ = α/2 and let c, c be fixed in Theorem 3.7, and let f : {0, 1} cd log n {0, 1} be (the Boolean function whose truth table is) given by the first 2 cd log n bits of S. By Theorem 3.7, G IW97 f derandomizes linear size circuits with Σ P k oracle and linear size nondeterministic circuits with Σ P k 1 oracle. Let NΣP k 1,S be the following nondeterministic Turing machine with oracles Σ P k 1 and S. inut x n = x guess w 1, w 2,...,w 2 c d log n {0, 1} (n) query the first 2 cd log n bits of S Let f : {0, 1} cd log n {0, 1} be given by the first 2 cdlog n bits of S for each string s i {0, 1} c dlog n do Let r i = G IW97 f (s i ) end for Let r = 0 for each r i if M ΣP k 1 (x, ri, w i ) = 1 then r = r + 1 end for r if 1/2 then outut 1 2 c d log n else outut 0. 9
10 By Theorem 3.7, for all x A +, there exists a witness w 1, w 2,...,w 2 c d log n such that N ΣP k 1,S (x)= 1, and, for all x A, such a witness does not exist. Therefore, the above NP ΣP k 1 machine searates A with oracle S and hence A Σ P,S k -Se. It should be noted that derandomization lays a significantly larger role in the roof of Corollary 3.6 than in the roofs of the analogous results for almost-classes. For examle, the roof by Bennett and Gill [5] that almost-p = BPP uses the easily roven fact that the set X = { S P S BPP S } has Lebesgue measure 0. Hitchcock [13] has recently roven that this set has Hausdorff dimension 1, so the Bennett-Gill argument does not extend to a roof of (3.5). Instead, our roof of (3.5) relies, via (3.1), on Theorem 3.7 to rove that the set Y = { S BPP P S } has Hausdorff dimension 0. Similarly, the roof by Nisan and Wigderson [26] that almost-np AM uses derandomization, but their roof that AM almost-np is elementary. In contrast, both directions of the roof of (3.6) use derandomization: The inclusion dimalmost-np AM relies on the fact that almost-np AM (hence on derandomization), and our roof that AM dimalmost-np relies, via (3.2), on Theorem Conclusion We conclude with a brief remark on relativization. Theorem 3.7 relativizes to arbitrary oracles, as to all our arguments here. For examle, imlication (3.1), 3 (S) > 0 = BPP PS, holds relative to every oracle. Note, however, that, if we consider this imlication relative to an oracle S of ositive 3 -dimension, then the relativized 3-dimension of this S will be 0, so we cannot use the relativized imlication to conclude that P S = BPP S. Indeed, by Hitchcock s just-mentioned result and (2.1), there must exist languages S of ositive 3-dimension for which P S BPP S. Acknowledgment. We are grateful to Eric Allender, whose discussions of the ideas in [1, 2] were a significant motivation of our work. We thank an anonymous referee for ointing out a flaw in our earlier roof. We thank John Hitchcock for useful discussions and suggestions. We also thank Manindra Agrawal for a useful discussion. References [1] E. Allender. When worlds collide: Derandomization, lower bounds, and kolmogorov comlexity. In Proceedings of the 21st annual Conference on Foundations of Software Technology and Theoretical Comuter Science, volume 2245 of Lecture Notes in Comuter Science, ages Sringer-Verlag, [2] E. Allender, H. Buhrman, M. Koucký, D. van Melkebeek, and D. Ronneburger. Power from random strings. In Proceedings of the 43rd Annual IEEE Symosium on Foundations of Comuter Science, ages , SIAM Journal on Comuting. To aear. [3] E. Allender and M. Strauss. Measure on small comlexity classes with alications for BPP. In Proceedings of the 35th Symosium on Foundations of Comuter Science, ages ,
11 [4] J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Comlexity I. Sringer-Verlag, Berlin, second edition, [5] C. H. Bennett and J. Gill. Relative to a random oracle A, P A NP A co-np A with robability 1. SIAM Journal on Comuting, 10:96 113, [6] H. Buhrman and L. Fortnow. One-sided versus two-sided randomness. In Proceedings of the sixteenth Symosium on Theoretical Asects of Comuter Science, ages , [7] N. Chomsky and G. A. Miller. Finite state languages. Information and Control, 1(2):91 112, [8] K. Falconer. Fractal Geometry: Mathematical Foundations and Alications. Wiley, second edition, [9] L. Fortnow. Comaring notions of full derandomization. In Proceedings of the 16th IEEE Conference on Comutational Comlexity, ages 28 34, [10] J. Grollman and A. Selman. Comlexity measures for ublic-key crytosystems. SIAM J. Comut., 11: , [11] F. Hausdorff. Dimension und äusseres Mass. Mathematische Annalen, 79: , [12] J. M. Hitchcock. Effective fractal dimension: foundations and alications. PhD thesis, Iowa State University, [13] J. M. Hitchcock. Hausdorff dimension and oracle constructions. Theoretical Comuter Science, 355(3): , [14] J. M. Hitchcock, J. H. Lutz, and E. Mayordomo. The fractal geometry of comlexity classes. SIGACT News, 36(3):24 38, [15] J. M. Hitchcock and N. V. Vinodchandran. Dimension, entroy rates, and comression. In Proceedings of the 19th IEEE Conference on Comutational Comlexity, ages , Journal of Comuter and System Sciences, to aear. [16] R. Imagliazzo and A. Wigderson. P = BPP if E requires exonential circuits: Derandomizing the XOR lemma. In Proceedings of the 29th Symosium on Theory of Comuting, ages , [17] W. Kuich. On the entroy of context-free languages. Information and Control, 16(2): , [18] J. H. Lutz. A seudorandom oracle characterization of BPP. SIAM Journal on Comuting, 22(5): , [19] J. H. Lutz. Dimension in comlexity classes. SIAM Journal on Comuting, 32: , [20] J. H. Lutz. Effective fractal dimensions. Mathematical Logic Quarterly, 51:62 72, [21] J. H. Lutz and W. J. Schmidt. Circuit size relative to seudorandom oracles. Theoretical Comuter Science, 107(1):95 120, March
12 [22] P. Martin-Löf. The definition of random sequences. Information and Control, 9: , [23] E. Mayordomo. Effective Hausdorff dimension. In Proceedings of Foundations of the Formal Sciences III, ages Kluwer Academic Press, [24] P. Moser. Relative to P romise-bpp equals APP. Technical Reort TR01-68, Electronic Colloquium on Comutational Comlexity, [25] P. Moser. Random nondeterministic real functions and Arthur Merlin games. Technical Reort TR02-006, ECCC, [26] N. Nisan and A. Wigderson. Hardness vs randomness. Journal of Comuter and System Sciences, 49: , [27] L. Staiger. Kolmogorov comlexity and Hausdorff dimension. Information and Comutation, 103:159 94, [28] L. Staiger. A tight uer bound on Kolmogorov comlexity and uniformly otimal rediction. Theory of Comuting Systems, 31:215 29, [29] C. B. Wilson. Relativized circuit comlexity. Journal of Comuter and System Sciences, 31: ,
Correspondence Principles for Effective Dimensions
Correspondence Principles for Effective Dimensions John M. Hitchcock Department of Computer Science Iowa State University Ames, IA 50011 jhitchco@cs.iastate.edu Abstract We show that the classical Hausdorff
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationPolynomial-Time Random Oracles and Separating Complexity Classes
Polynomial-Time Random Oracles and Separating Complexity Classes John M. Hitchcock Department of Computer Science University of Wyoming jhitchco@cs.uwyo.edu Adewale Sekoni Department of Computer Science
More informationLecture 9: Connecting PH, P/poly and BPP
Comutational Comlexity Theory, Fall 010 Setember Lecture 9: Connecting PH, P/oly and BPP Lecturer: Kristoffer Arnsfelt Hansen Scribe: Martin Sergio Hedevang Faester Although we do not know how to searate
More informationLimitations of Efficient Reducibility to the Kolmogorov Random Strings
Limitations of Efficient Reducibility to the Kolmogorov Random Strings John M. HITCHCOCK 1 Department of Computer Science, University of Wyoming Abstract. We show the following results for polynomial-time
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationLow-Depth Witnesses are Easy to Find
Low-Depth Witnesses are Easy to Find Luis Antunes U. Porto Lance Fortnow U. Chicago Alexandre Pinto U. Porto André Souto U. Porto Abstract Antunes, Fortnow, van Melkebeek and Vinodchandran captured the
More informationOn the capacity of the general trapdoor channel with feedback
On the caacity of the general tradoor channel with feedback Jui Wu and Achilleas Anastasooulos Electrical Engineering and Comuter Science Deartment University of Michigan Ann Arbor, MI, 48109-1 email:
More informationLimits of Minimum Circuit Size Problem as Oracle
Limits of Minimum Circuit Size Problem as Oracle Shuichi Hirahara(The University of Tokyo) Osamu Watanabe(Tokyo Institute of Technology) CCC 2016/05/30 Minimum Circuit Size Problem (MCSP) Input Truth table
More informationDerandomizing from Random Strings
Derandomizing from Random Strings Harry Buhrman CWI and University of Amsterdam buhrman@cwi.nl Lance Fortnow Northwestern University fortnow@northwestern.edu Michal Koucký Institute of Mathematics, AS
More informationAn Overview of Witt Vectors
An Overview of Witt Vectors Daniel Finkel December 7, 2007 Abstract This aer offers a brief overview of the basics of Witt vectors. As an alication, we summarize work of Bartolo and Falcone to rove that
More informationThen RAND RAND(pspace), so (1.1) and (1.2) together immediately give the random oracle characterization BPP = fa j (8B 2 RAND) A 2 P(B)g: (1:3) Since
A Note on Independent Random Oracles Jack H. Lutz Department of Computer Science Iowa State University Ames, IA 50011 Abstract It is shown that P(A) \ P(B) = BPP holds for every A B. algorithmically random
More informationConvex Analysis and Economic Theory Winter 2018
Division of the Humanities and Social Sciences Ec 181 KC Border Conve Analysis and Economic Theory Winter 2018 Toic 16: Fenchel conjugates 16.1 Conjugate functions Recall from Proosition 14.1.1 that is
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationComparing Reductions to NP-Complete Sets
Comparing Reductions to NP-Complete Sets John M. Hitchcock A. Pavan Abstract Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following:
More informationA Note on the Karp-Lipton Collapse for the Exponential Hierarchy
A Note on the Karp-Lipton Collapse for the Exponential Hierarchy Chris Bourke Department of Computer Science & Engineering University of Nebraska Lincoln, NE 68503, USA Email: cbourke@cse.unl.edu January
More informationwhere x i is the ith coordinate of x R N. 1. Show that the following upper bound holds for the growth function of H:
Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 2 October 25, 2017 Due: November 08, 2017 A. Growth function Growth function of stum functions.
More informationA note on exponential circuit lower bounds from derandomizing Arthur-Merlin games
Electronic Colloquium on Computational Complexity, Report No. 74 (200) A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games Harry Buhrman Scott Aaronson MIT aaronson@csail.mit.edu
More informationConstructive Dimension and Weak Truth-Table Degrees
Constructive Dimension and Weak Truth-Table Degrees Laurent Bienvenu 1, David Doty 2 and Frank Stephan 3 1 Laboratoire d Informatique Fondamentale de Marseille, Université de Provence, 39 rue Joliot-Curie,
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationResearch Article An iterative Algorithm for Hemicontractive Mappings in Banach Spaces
Abstract and Alied Analysis Volume 2012, Article ID 264103, 11 ages doi:10.1155/2012/264103 Research Article An iterative Algorithm for Hemicontractive Maings in Banach Saces Youli Yu, 1 Zhitao Wu, 2 and
More informationAnalysis of some entrance probabilities for killed birth-death processes
Analysis of some entrance robabilities for killed birth-death rocesses Master s Thesis O.J.G. van der Velde Suervisor: Dr. F.M. Sieksma July 5, 207 Mathematical Institute, Leiden University Contents Introduction
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
More informationIn Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time
In Search of an Easy Witness: Exponential Time vs. Probabilistic Polynomial Time Russell Impagliazzo Department of Computer Science University of California, San Diego La Jolla, CA 92093-0114 russell@cs.ucsd.edu
More informationResearch Statement. Donald M. Stull. December 29, 2016
Research Statement Donald M. Stull December 29, 2016 1 Overview My research is focused on the interaction between analysis and theoretical computer science. Typically, theoretical computer science is concerned
More informationInequalities for the L 1 Deviation of the Empirical Distribution
Inequalities for the L 1 Deviation of the Emirical Distribution Tsachy Weissman, Erik Ordentlich, Gadiel Seroussi, Sergio Verdu, Marcelo J. Weinberger June 13, 2003 Abstract We derive bounds on the robability
More informationRelativized Worlds with an Innite Hierarchy. Lance Fortnow y. University of Chicago E. 58th. St. Chicago, IL Abstract
Relativized Worlds with an Innite Hierarchy Lance Fortnow y University of Chicago Department of Computer Science 1100 E. 58th. St. Chicago, IL 60637 Abstract We introduce the \Book Trick" as a method for
More informationLecture 23: Alternation vs. Counting
CS 710: Complexity Theory 4/13/010 Lecture 3: Alternation vs. Counting Instructor: Dieter van Melkebeek Scribe: Jeff Kinne & Mushfeq Khan We introduced counting complexity classes in the previous lecture
More information1. Introduction In this note we prove the following result which seems to have been informally conjectured by Semmes [Sem01, p. 17].
A REMARK ON POINCARÉ INEQUALITIES ON METRIC MEASURE SPACES STEPHEN KEITH AND KAI RAJALA Abstract. We show that, in a comlete metric measure sace equied with a doubling Borel regular measure, the Poincaré
More informationON THE LEAST SIGNIFICANT p ADIC DIGITS OF CERTAIN LUCAS NUMBERS
#A13 INTEGERS 14 (014) ON THE LEAST SIGNIFICANT ADIC DIGITS OF CERTAIN LUCAS NUMBERS Tamás Lengyel Deartment of Mathematics, Occidental College, Los Angeles, California lengyel@oxy.edu Received: 6/13/13,
More informationBi-Immunity Separates Strong NP-Completeness Notions
Bi-Immunity Separates Strong NP-Completeness Notions A. Pavan 1 and Alan L Selman 2 1 NEC Research Institute, 4 Independence way, Princeton, NJ 08540. apavan@research.nj.nec.com 2 Department of Computer
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationRandomness Extraction in finite fields F p
Randomness Extraction in finite fields F n Abdoul Aziz Ciss École doctorale de Mathématiques et d Informatique, Université Cheikh Anta Dio de Dakar, Sénégal BP: 5005, Dakar Fann abdoul.ciss@ucad.edu.sn,
More informationRecognizing Tautology by a Deterministic Algorithm Whose While-loop s Execution Time Is Bounded by Forcing. Toshio Suzuki
Recognizing Tautology by a Deterministic Algorithm Whose While-loop s Execution Time Is Bounded by Forcing Toshio Suzui Osaa Prefecture University Saai, Osaa 599-8531, Japan suzui@mi.cias.osaafu-u.ac.jp
More informationVarious Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various Families of R n Norms and Some Open Problems
Int. J. Oen Problems Comt. Math., Vol. 3, No. 2, June 2010 ISSN 1998-6262; Coyright c ICSRS Publication, 2010 www.i-csrs.org Various Proofs for the Decrease Monotonicity of the Schatten s Power Norm, Various
More informationKolmogorov-Loveland Randomness and Stochasticity
Kolmogorov-Loveland Randomness and Stochasticity Wolfgang Merkle 1, Joseph Miller 2, André Nies 3, Jan Reimann 1, and Frank Stephan 4 1 Universität Heidelberg, Heidelberg, Germany 2 Indiana University,
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 informationKolmogorov-Loveland Randomness and Stochasticity
Kolmogorov-Loveland Randomness and Stochasticity Wolfgang Merkle 1 Joseph Miller 2 André Nies 3 Jan Reimann 1 Frank Stephan 4 1 Institut für Informatik, Universität Heidelberg 2 Department of Mathematics,
More informationThe non-stochastic multi-armed bandit problem
Submitted for journal ublication. The non-stochastic multi-armed bandit roblem Peter Auer Institute for Theoretical Comuter Science Graz University of Technology A-8010 Graz (Austria) auer@igi.tu-graz.ac.at
More informationSome Results on Derandomization
Some Results on Derandomization Harry Buhrman CWI and University of Amsterdam Lance Fortnow University of Chicago A. Pavan Iowa State University Abstract We show several results about derandomization including
More informationIntrinsic Approximation on Cantor-like Sets, a Problem of Mahler
Intrinsic Aroximation on Cantor-like Sets, a Problem of Mahler Ryan Broderick, Lior Fishman, Asaf Reich and Barak Weiss July 200 Abstract In 984, Kurt Mahler osed the following fundamental question: How
More informationSome Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems
Some Results on Circuit Lower Bounds and Derandomization of Arthur-Merlin Problems D. M. Stull December 14, 2016 Abstract We prove a downward separation for Σ 2 -time classes. Specifically, we prove that
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More informationExtracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
Electronic Colloquium on Computational Complexity, Report No. 105 (2005) Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws Lance Fortnow John M. Hitchcock A. Pavan N. V. Vinodchandran
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationFor q 0; 1; : : : ; `? 1, we have m 0; 1; : : : ; q? 1. The set fh j(x) : j 0; 1; ; : : : ; `? 1g forms a basis for the tness functions dened on the i
Comuting with Haar Functions Sami Khuri Deartment of Mathematics and Comuter Science San Jose State University One Washington Square San Jose, CA 9519-0103, USA khuri@juiter.sjsu.edu Fax: (40)94-500 Keywords:
More informationOn Z p -norms of random vectors
On Z -norms of random vectors Rafa l Lata la Abstract To any n-dimensional random vector X we may associate its L -centroid body Z X and the corresonding norm. We formulate a conjecture concerning the
More informationk- price auctions and Combination-auctions
k- rice auctions and Combination-auctions Martin Mihelich Yan Shu Walnut Algorithms March 6, 219 arxiv:181.3494v3 [q-fin.mf] 5 Mar 219 Abstract We rovide for the first time an exact analytical solution
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationRIEMANN-STIELTJES OPERATORS BETWEEN WEIGHTED BERGMAN SPACES
RIEMANN-STIELTJES OPERATORS BETWEEN WEIGHTED BERGMAN SPACES JIE XIAO This aer is dedicated to the memory of Nikolaos Danikas 1947-2004) Abstract. This note comletely describes the bounded or comact Riemann-
More informationExtremal Polynomials with Varying Measures
International Mathematical Forum, 2, 2007, no. 39, 1927-1934 Extremal Polynomials with Varying Measures Rabah Khaldi Deartment of Mathematics, Annaba University B.P. 12, 23000 Annaba, Algeria rkhadi@yahoo.fr
More informationOn the NP-Completeness of the Minimum Circuit Size Problem
On the NP-Completeness of the Minimum Circuit Size Problem John M. Hitchcock Department of Computer Science University of Wyoming A. Pavan Department of Computer Science Iowa State University Abstract
More informationNamed Entity Recognition using Maximum Entropy Model SEEM5680
Named Entity Recognition using Maximum Entroy Model SEEM5680 Named Entity Recognition System Named Entity Recognition (NER): Identifying certain hrases/word sequences in a free text. Generally it involves
More informationOn the optimal compression of sets in P, NP, P/poly, PSPACE/poly
On the optimal compression of sets in P, NP, P/poly, PSPACE/poly Marius Zimand Towson University CCR 2012- Cambridge Marius Zimand (Towson U.) Compression P, NP, P/poly sets 2011 1 / 19 The language compression
More informationNotes on duality in second order and -order cone otimization E. D. Andersen Λ, C. Roos y, and T. Terlaky z Aril 6, 000 Abstract Recently, the so-calle
McMaster University Advanced Otimization Laboratory Title: Notes on duality in second order and -order cone otimization Author: Erling D. Andersen, Cornelis Roos and Tamás Terlaky AdvOl-Reort No. 000/8
More informationA New Perspective on Learning Linear Separators with Large L q L p Margins
A New Persective on Learning Linear Searators with Large L q L Margins Maria-Florina Balcan Georgia Institute of Technology Christoher Berlind Georgia Institute of Technology Abstract We give theoretical
More informationOn a Markov Game with Incomplete Information
On a Markov Game with Incomlete Information Johannes Hörner, Dinah Rosenberg y, Eilon Solan z and Nicolas Vieille x{ January 24, 26 Abstract We consider an examle of a Markov game with lack of information
More information#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS
#A64 INTEGERS 18 (2018) APPLYING MODULAR ARITHMETIC TO DIOPHANTINE EQUATIONS Ramy F. Taki ElDin Physics and Engineering Mathematics Deartment, Faculty of Engineering, Ain Shams University, Cairo, Egyt
More informationEFFECTIVE FRACTAL DIMENSIONS
EFFECTIVE FRACTAL DIMENSIONS Jack H. Lutz Iowa State University Copyright c Jack H. Lutz, 2011. All rights reserved. Lectures 1. Classical and Constructive Fractal Dimensions 2. Dimensions of Points in
More informationImpossibility of a Quantum Speed-up with a Faulty Oracle
Imossibility of a Quantum Seed-u with a Faulty Oracle Oded Regev Liron Schiff Abstract We consider Grover s unstructured search roblem in the setting where each oracle call has some small robability of
More informationPARTITIONS AND (2k + 1) CORES. 1. Introduction
PARITY RESULTS FOR BROKEN k DIAMOND PARTITIONS AND 2k + CORES SILVIU RADU AND JAMES A. SELLERS Abstract. In this aer we rove several new arity results for broken k-diamond artitions introduced in 2007
More informationA Divergence Formula for Randomness and Dimension
A Divergence Formula for Romness Dimension Jack H. Lutz Department of Computer Science Iowa State University Ames, IA 500, USA lutz@cs.iastate.edu Abstract If S is an infinite sequence over a finite alphabet
More informationPETER J. GRABNER AND ARNOLD KNOPFMACHER
ARITHMETIC AND METRIC PROPERTIES OF -ADIC ENGEL SERIES EXPANSIONS PETER J. GRABNER AND ARNOLD KNOPFMACHER Abstract. We derive a characterization of rational numbers in terms of their unique -adic Engel
More information4 th Week. Relativizations and Hierarchies
4 th Week Relativizations and Hierarchies Synosis. Oracle Turing Machines and Relativization The Polynomial Hierarchy Generic Oracles Collasing Recursive Oracles The Hierarchy Aril 30, 2018. 23:59 Course
More informationSharp gradient estimate and spectral rigidity for p-laplacian
Shar gradient estimate and sectral rigidity for -Lalacian Chiung-Jue Anna Sung and Jiaing Wang To aear in ath. Research Letters. Abstract We derive a shar gradient estimate for ositive eigenfunctions of
More informationBest approximation by linear combinations of characteristic functions of half-spaces
Best aroximation by linear combinations of characteristic functions of half-saces Paul C. Kainen Deartment of Mathematics Georgetown University Washington, D.C. 20057-1233, USA Věra Kůrková Institute of
More informationElliptic Curves and Cryptography
Ellitic Curves and Crytograhy Background in Ellitic Curves We'll now turn to the fascinating theory of ellitic curves. For simlicity, we'll restrict our discussion to ellitic curves over Z, where is a
More informationON POLYNOMIAL SELECTION FOR THE GENERAL NUMBER FIELD SIEVE
MATHEMATICS OF COMPUTATIO Volume 75, umber 256, October 26, Pages 237 247 S 25-5718(6)187-9 Article electronically ublished on June 28, 26 O POLYOMIAL SELECTIO FOR THE GEERAL UMBER FIELD SIEVE THORSTE
More informationBrownian Motion and Random Prime Factorization
Brownian Motion and Random Prime Factorization Kendrick Tang June 4, 202 Contents Introduction 2 2 Brownian Motion 2 2. Develoing Brownian Motion.................... 2 2.. Measure Saces and Borel Sigma-Algebras.........
More informationLanguage Compression and Pseudorandom Generators
Language Compression and Pseudorandom Generators Harry Buhrman Troy Lee CWI and University of Amsterdam Harry.Buhrman@cwi.nl Troy.Lee@cwi.nl Dieter van Melkebeek University of Wisconsin-Madison dieter@cs.wisc.edu
More informationApplications to stochastic PDE
15 Alications to stochastic PE In this final lecture we resent some alications of the theory develoed in this course to stochastic artial differential equations. We concentrate on two secific examles:
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 18, 2012 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationMatching Partition a Linked List and Its Optimization
Matching Partition a Linked List and Its Otimization Yijie Han Deartment of Comuter Science University of Kentucky Lexington, KY 40506 ABSTRACT We show the curve O( n log i + log (i) n + log i) for the
More informationVerifying Two Conjectures on Generalized Elite Primes
1 2 3 47 6 23 11 Journal of Integer Sequences, Vol. 12 (2009), Article 09.4.7 Verifying Two Conjectures on Generalized Elite Primes Xiaoqin Li 1 Mathematics Deartment Anhui Normal University Wuhu 241000,
More informationExponential time vs probabilistic polynomial time
Exponential time vs probabilistic polynomial time Sylvain Perifel (LIAFA, Paris) Dagstuhl January 10, 2012 Introduction Probabilistic algorithms: can toss a coin polynomial time (worst case) probability
More informationA Social Welfare Optimal Sequential Allocation Procedure
A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential
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 information216 S. Chandrasearan and I.C.F. Isen Our results dier from those of Sun [14] in two asects: we assume that comuted eigenvalues or singular values are
Numer. Math. 68: 215{223 (1994) Numerische Mathemati c Sringer-Verlag 1994 Electronic Edition Bacward errors for eigenvalue and singular value decomositions? S. Chandrasearan??, I.C.F. Isen??? Deartment
More informationThe Fekete Szegő theorem with splitting conditions: Part I
ACTA ARITHMETICA XCIII.2 (2000) The Fekete Szegő theorem with slitting conditions: Part I by Robert Rumely (Athens, GA) A classical theorem of Fekete and Szegő [4] says that if E is a comact set in the
More informationProof: We follow thearoach develoed in [4]. We adot a useful but non-intuitive notion of time; a bin with z balls at time t receives its next ball at
A Scaling Result for Exlosive Processes M. Mitzenmacher Λ J. Sencer We consider the following balls and bins model, as described in [, 4]. Balls are sequentially thrown into bins so that the robability
More informationResearch Article Controllability of Linear Discrete-Time Systems with Both Delayed States and Delayed Inputs
Abstract and Alied Analysis Volume 203 Article ID 97546 5 ages htt://dxdoiorg/055/203/97546 Research Article Controllability of Linear Discrete-Time Systems with Both Delayed States and Delayed Inuts Hong
More informationarxiv: v1 [quant-ph] 3 Feb 2015
From reversible comutation to quantum comutation by Lagrange interolation Alexis De Vos and Stin De Baerdemacker 2 arxiv:502.0089v [quant-h] 3 Feb 205 Cmst, Imec v.z.w., vakgroe elektronica en informatiesystemen,
More informationMultiplicity of weak solutions for a class of nonuniformly elliptic equations of p-laplacian type
Nonlinear Analysis 7 29 536 546 www.elsevier.com/locate/na Multilicity of weak solutions for a class of nonuniformly ellitic equations of -Lalacian tye Hoang Quoc Toan, Quô c-anh Ngô Deartment of Mathematics,
More informationThis is an author produced version of Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes..
This is an author produced version of Characterizing the Existence of Optimal Proof Systems and Complete Sets for Promise Classes.. White Rose Research Online URL for this paper: http://eprints.whiterose.ac.uk/74777/
More informationHAUSDORFF MEASURE OF p-cantor SETS
Real Analysis Exchange Vol. 302), 2004/2005,. 20 C. Cabrelli, U. Molter, Deartamento de Matemática, Facultad de Cs. Exactas y Naturales, Universidad de Buenos Aires and CONICET, Pabellón I - Ciudad Universitaria,
More informationOutline. CS21 Decidability and Tractability. Regular expressions and FA. Regular expressions and FA. Regular expressions and FA
Outline CS21 Decidability and Tractability Lecture 4 January 14, 2019 FA and Regular Exressions Non-regular languages: Puming Lemma Pushdown Automata Context-Free Grammars and Languages January 14, 2019
More informationExtension of Minimax to Infinite Matrices
Extension of Minimax to Infinite Matrices Chris Calabro June 21, 2004 Abstract Von Neumann s minimax theorem is tyically alied to a finite ayoff matrix A R m n. Here we show that (i) if m, n are both inite,
More informationPseudo-Random Generators and Structure of Complete Degrees
Pseudo-Random Generators and Structure of Complete Degrees Manindra Agrawal Dept of CSE, IIT Kanpur 208016, India email: manindra@iitk.ac.in Abstract It is shown that if there exist sets in E that require
More informationGIVEN an input sequence x 0,..., x n 1 and the
1 Running Max/Min Filters using 1 + o(1) Comarisons er Samle Hao Yuan, Member, IEEE, and Mikhail J. Atallah, Fellow, IEEE Abstract A running max (or min) filter asks for the maximum or (minimum) elements
More informationA Note on Guaranteed Sparse Recovery via l 1 -Minimization
A Note on Guaranteed Sarse Recovery via l -Minimization Simon Foucart, Université Pierre et Marie Curie Abstract It is roved that every s-sarse vector x C N can be recovered from the measurement vector
More informationGENERALIZED NORMS INEQUALITIES FOR ABSOLUTE VALUE OPERATORS
International Journal of Analysis Alications ISSN 9-8639 Volume 5, Number (04), -9 htt://www.etamaths.com GENERALIZED NORMS INEQUALITIES FOR ABSOLUTE VALUE OPERATORS ILYAS ALI, HU YANG, ABDUL SHAKOOR Abstract.
More informationFormal Modeling in Cognitive Science Lecture 29: Noisy Channel Model and Applications;
Formal Modeling in Cognitive Science Lecture 9: and ; ; Frank Keller School of Informatics University of Edinburgh keller@inf.ed.ac.uk Proerties of 3 March, 6 Frank Keller Formal Modeling in Cognitive
More informationON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY Volume 00, Number 0, Pages 000 000 S 000-9939XX)0000-0 ON THE NORM OF AN IDEMPOTENT SCHUR MULTIPLIER ON THE SCHATTEN CLASS WILLIAM D. BANKS AND ASMA HARCHARRAS
More informationComputational Depth: Concept and Applications
Computational Depth: Concept and Applications Luis Antunes 1, Lance Fortnow 2, Dieter van Melkebeek 3, and N. V. Vinodchandran 4 1 DCC-FC & LIACC University of Porto, Porto, Portugal 2 Department of Computer
More informationLecture 21: Quantum Communication
CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture
More informationBent Functions of maximal degree
IEEE TRANSACTIONS ON INFORMATION THEORY 1 Bent Functions of maximal degree Ayça Çeşmelioğlu and Wilfried Meidl Abstract In this article a technique for constructing -ary bent functions from lateaued functions
More informationIS VALIANT VAZIRANI S ISOLATION PROBABILITY IMPROVABLE? Holger Dell, Valentine Kabanets, Dieter van Melkebeek, and Osamu Watanabe December 31, 2012
IS VALIANT VAZIRANI S ISOLATION PROBABILITY IMPROVABLE? Holger Dell, Valentine Kabanets, Dieter van Melkebeek, and Osamu Watanabe December 31, 2012 Abstract. The Isolation Lemma of Valiant & Vazirani (1986)
More informationB8.1 Martingales Through Measure Theory. Concept of independence
B8.1 Martingales Through Measure Theory Concet of indeendence Motivated by the notion of indeendent events in relims robability, we have generalized the concet of indeendence to families of σ-algebras.
More information