Counting dependent and independent strings
|
|
- Gertrude Nichols
- 5 years ago
- Views:
Transcription
1 Counting dependent and independent strings Marius Zimand Towson University MFCS 2010, Brno Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
2 General principle Background In a large set some relationship emerges among its elements. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
3 Background Instances of the general principle n + 1 vectors in an n-dimensional vector space are dependent. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
4 Background Instances of the general principle n + 1 vectors in an n-dimensional vector space are dependent. For all k and all n sufficiently large, any subset of [n] of positive density must contain k elements in arithmetic progression. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
5 Background Instances of the general principle n + 1 vectors in an n-dimensional vector space are dependent. For all k and all n sufficiently large, any subset of [n] of positive density must contain k elements in arithmetic progression. Any set of 5 points in the plane contains a 4-vertices convex polygon. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
6 Background Instances of the general principle n + 1 vectors in an n-dimensional vector space are dependent. For all k and all n sufficiently large, any subset of [n] of positive density must contain k elements in arithmetic progression. Any set of 5 points in the plane contains a 4-vertices convex polygon. Ramsey Theorem,... Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
7 Main General principle in algorithmical information theory How large should a set of n-bit strings be, to be sure that its elements share some information? Gist of our main results: If A {0, 1} n has size poly(n)2 α, then its elements share α bits of information. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
8 Main Kolmogorov complexity Kolmogorov complexity of a string is the length of its shortest description {}}{ has a short description. flipping a coin times: : description bits. Definition: C(x) = min{ p U(p) = x}; C(x y) = min{ p U(p, y) = x}, where U is a fixed universal Turing machine. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
9 Main Mutual information, string dependency x, y binary n-bit strings. I (x : y) = quantity of information in x about y. DEFINITION: I (x : y) = C(y) C(y x). Symmetry of Information: I (x : y) = I (y : x) ± O(log n). DEFINITION: y has α-dependency with x if C(y) C(y x) α. Informally: x has α bits of information about y. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
10 Main Two notions of independence Pairwise independence The set {x 1,..., x t } of n-bit strings is pairwise independent if C(x i ) C(x i x j ) α, for all i j. Informally: No string has more than α bits of information about any other string. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
11 Main Two notions of independence Pairwise independence The set {x 1,..., x t } of n-bit strings is pairwise independent if C(x i ) C(x i x j ) α, for all i j. Informally: No string has more than α bits of information about any other string. Mutual independence The tuple (x 1,..., x t ) of n-bit strings is mutually α-independent if for every permutation π, C(x π(1) x π(2)... x π(t) ) C(x 1 ) + C(x 2 ) C(x t ) α. Informally: x 1,..., x t share jointly at most α bits of information. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
12 Main First main result Theorem {x 1, x 2,..., x t } is α-pairwise independent t < poly(n)2 α, (where, poly(n) = 2n 3 ). Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
13 Main First main result Theorem {x 1, x 2,..., x t } is α-pairwise independent t < poly(n)2 α, (where, poly(n) = 2n 3 ). Theorem The above is tight within a polynomial factor. There exists {x 1, x 2,..., x t } α-pairwise independent with t = 1 poly(n) 2α (provided 5 log n α n). Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
14 Main Second main result Theorem (x 1,..., x t ) mutually α-independent t < poly(n)2 α, (provided 7 log n + 6 α n). Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
15 Main Second main result Theorem (x 1,..., x t ) mutually α-independent t < poly(n)2 α, (provided 7 log n + 6 α n). We do not know if the above is tight. We believe it is within a polynomial factor. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
16 One proof Some proofs How many strings are dependent with a given string? A x,α : the set of strings about which x {0, 1} n has α bits of information. A x,α = {y {0, 1} n C(y) C(y x) α}. We want to estimate the size of A x,α. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
17 Upper bound is easy Some proofs Goal: Upper bound the size of A x,α = {y {0, 1} n C(y) C(y x) α}. If y A x,α, C(y x) C(y) α = n α + O(1). There are at most 2 n α+o(1) such strings y. So, A x,α C 2 n α, for some constant C. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
18 Some proofs Lower bound; main technical innovation of the paper Goal: Lower bound the size of A x,α = {y {0, 1} n C(y) C(y x) α}. Normal approach for a lower bound of A x,α : Suppose x is random (the proof can be adapted for non-random strings). x α (the α prefix of x) is also random. Take z of length (n α) and random conditioned by x α. Let y = zx α. There are 2 n α such strings. C(y) C(x α) + C(z x α) O(log n) α + (n α) O(log n) = n O(log n). Also, C(y x) n α + O(log n). So, y A x,α+o(log n). So, A x,α+o(log n) 2 n α. So, A x,α (1/poly(n)) 2 n α. Novel approach: A x,α (1/C) 2 n α poly(n) 2 α. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
19 Some proofs Lower bound: new approach Goal: Lower bound the size of A x,α = {y {0, 1} n C(y) C(y x) α}, for x with C(x) α + 8 log n, and α computable from n. Corollary of [Z MFCS 2010] For every constant c, there exists uniformly computable E : {0, 1} n {0, 1} n {0, 1} α+c+o(1) s.t. for all y in {0, 1} n IF C(y) α + 8 log n and C(y n) C(y x) α THEN C(E(x, y) x) c. Let z in Image(f ) with the largest number of preimages in {x} {0, 1} n. z has at least 2 n α c O(1) such preimages. C(z x) < c. So, all the preimages of z fail to satisfy the IF condition. So, {y C(y n) C(y x) α} (1/C) 2 n α poly(n)2 α. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
20 Some proofs Another proof What is the size of a min dominating set in the dependency graph? Theorem There exists a set B {0, 1} n of size poly(n) 2 α, such that any string in {0, 1} n is α-dependent with a string in B (i.e., for any string u, there is some string in B that has α bits of information about u). Take x 1,..., x T independently at random in {0, 1} n, for T = poly(n)2 α. Fix u {0, 1} n. At least (1/C)2 n α strings have α bits of information about u. Prob(u is not in any A xi,α) < (1 (1/C)2 α ) T < e n. Prob(some u {0, 1} n is not in any A xi,α) < 2 n e n < 1. So there are some tuplet (x 1,..., x t ) that covers all strings u {0, 1} n. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
21 Some proofs Thank you. Marius Zimand (Towson U.) Counting Dependent/Indep. Strings August / 15
Counting dependent and independent strings
Counting dependent and independent strings Marius Zimand Department of Computer and Information Sciences, Towson University, Baltimore, MD, USA Abstract. We derive quantitative results regarding sets of
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 informationSymmetry of Information: A Closer Look
Symmetry of Information: A Closer Look Marius Zimand. Department of Computer and Information Sciences, Towson University, Baltimore, MD, USA Abstract. Symmetry of information establishes a relation between
More informationOn approximate decidability of minimal programs 1
On approximate decidability of minimal programs 1 Jason Teutsch June 12, 2014 1 Joint work with Marius Zimand How not to estimate complexity What s hard about Kolmogorov complexity? the case of functions
More informationPossibilities and impossibilities in Kolmogorov complexity extraction
Possibilities and impossibilities in Kolmogorov complexity extraction Marius Zimand Abstract Randomness extraction is the process of constructing a source of randomness of high quality from one or several
More informationKolmogorov complexity
Kolmogorov complexity In this section we study how we can define the amount of information in a bitstring. Consider the following strings: 00000000000000000000000000000000000 0000000000000000000000000000000000000000
More informationCISC 876: Kolmogorov Complexity
March 27, 2007 Outline 1 Introduction 2 Definition Incompressibility and Randomness 3 Prefix Complexity Resource-Bounded K-Complexity 4 Incompressibility Method Gödel s Incompleteness Theorem 5 Outline
More informationKolmogorov Complexity in Randomness Extraction
LIPIcs Leibniz International Proceedings in Informatics Kolmogorov Complexity in Randomness Extraction John M. Hitchcock, A. Pavan 2, N. V. Vinodchandran 3 Department of Computer Science, University of
More information2 Plain Kolmogorov Complexity
2 Plain Kolmogorov Complexity In this section, we introduce plain Kolmogorov Complexity, prove the invariance theorem - that is, the complexity of a string does not depend crucially on the particular model
More informationA An Overview of Complexity Theory for the Algorithm Designer
A An Overview of Complexity Theory for the Algorithm Designer A.1 Certificates and the class NP A decision problem is one whose answer is either yes or no. Two examples are: SAT: Given a Boolean formula
More informationA list-decodable code with local encoding and decoding
A list-decodable code with local encoding and decoding Marius Zimand Towson University Department of Computer and Information Sciences Baltimore, MD http://triton.towson.edu/ mzimand Abstract For arbitrary
More informationKolmogorov complexity and its applications
CS860, Winter, 2010 Kolmogorov complexity and its applications Ming Li School of Computer Science University of Waterloo http://www.cs.uwaterloo.ca/~mli/cs860.html We live in an information society. Information
More informationLecture 1: September 25, A quick reminder about random variables and convexity
Information and Coding Theory Autumn 207 Lecturer: Madhur Tulsiani Lecture : September 25, 207 Administrivia This course will cover some basic concepts in information and coding theory, and their applications
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 informationFORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY
15-453 FORMAL LANGUAGES, AUTOMATA AND COMPUTABILITY KOLMOGOROV-CHAITIN (descriptive) COMPLEXITY TUESDAY, MAR 18 CAN WE QUANTIFY HOW MUCH INFORMATION IS IN A STRING? A = 01010101010101010101010101010101
More information1 Locally computable randomized encodings
CSG399: Gems of Theoretical Computer Science Lectures 3-4 Feb 20-24, 2009 Instructor: Emanuele Viola Scribe: Eric Miles Cryptography in constant depth: II & III Locally computable randomized encodings
More information3 Self-Delimiting Kolmogorov complexity
3 Self-Delimiting Kolmogorov complexity 3. Prefix codes A set is called a prefix-free set (or a prefix set) if no string in the set is the proper prefix of another string in it. A prefix set cannot therefore
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 informationKolmogorov complexity and its applications
Spring, 2009 Kolmogorov complexity and its applications Paul Vitanyi Computer Science University of Amsterdam http://www.cwi.nl/~paulv/course-kc We live in an information society. Information science is
More informationCSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS
CSCI 2200 Foundations of Computer Science Spring 2018 Quiz 3 (May 2, 2018) SOLUTIONS 1. [6 POINTS] For language L 1 = {0 n 1 m n, m 1, m n}, which string is in L 1? ANSWER: 0001111 is in L 1 (with n =
More informationFinish K-Complexity, Start Time Complexity
6.045 Finish K-Complexity, Start Time Complexity 1 Kolmogorov Complexity Definition: The shortest description of x, denoted as d(x), is the lexicographically shortest string such that M(w) halts
More informationNotes for Lecture 3... x 4
Stanford University CS254: Computational Complexity Notes 3 Luca Trevisan January 14, 2014 Notes for Lecture 3 In this lecture we introduce the computational model of boolean circuits and prove that polynomial
More informationAlmost transparent short proofs for NP R
Brandenburgische Technische Universität, Cottbus, Germany From Dynamics to Complexity: A conference celebrating the work of Mike Shub Toronto, May 10, 2012 Supported by DFG under GZ:ME 1424/7-1 Outline
More informationSome Properties of Antistochastic Strings. Alexey Milovanov. Theory of Computing Systems ISSN
Some Properties of Antistochastic Strings Alexey Milovanov Theory of Computing Systems ISSN 1432-4350 DOI 10.1007/s00224-016-9695-z 1 23 Your article is protected by copyright and all rights are held exclusively
More informationAdvanced Algorithms (XIII) Yijia Chen Fudan University
Advanced Algorithms (XIII) Yijia Chen Fudan University The PCP Theorem Theorem NP = PCP(log n, 1). Motivation Approximate solutions Definition (Approximation of MAX-3SAT) For every 3CNF formula ϕ, the
More informationStochasticity in Algorithmic Statistics for Polynomial Time
Stochasticity in Algorithmic Statistics for Polynomial Time Alexey Milovanov 1 and Nikolay Vereshchagin 2 1 National Research University Higher School of Economics, Moscow, Russia almas239@gmail.com 2
More informationIs there an Elegant Universal Theory of Prediction?
Is there an Elegant Universal Theory of Prediction? Shane Legg Dalle Molle Institute for Artificial Intelligence Manno-Lugano Switzerland 17th International Conference on Algorithmic Learning Theory Is
More informationNotes on Computer Theory Last updated: November, Circuits
Notes on Computer Theory Last updated: November, 2015 Circuits Notes by Jonathan Katz, lightly edited by Dov Gordon. 1 Circuits Boolean circuits offer an alternate model of computation: a non-uniform one
More informationFoundations of Query Languages
Foundations of Query Languages SS 2011 2. 2. Foundations of Query Languages Dr. Fang Wei Lehrstuhl für Datenbanken und Informationssysteme Universität Freiburg SS 2011 Dr. Fang Wei 30. Mai 2011 Seite 1
More informationTT-FUNCTIONALS AND MARTIN-LÖF RANDOMNESS FOR BERNOULLI MEASURES
TT-FUNCTIONALS AND MARTIN-LÖF RANDOMNESS FOR BERNOULLI MEASURES LOGAN AXON Abstract. For r [0, 1], the Bernoulli measure µ r on the Cantor space {0, 1} N assigns measure r to the set of sequences with
More informationTheory of Computation
Theory of Computation Lecture #6 Sarmad Abbasi Virtual University Sarmad Abbasi (Virtual University) Theory of Computation 1 / 39 Lecture 6: Overview Prove the equivalence of enumerators and TMs. Dovetailing
More informationAlgebras with finite descriptions
Algebras with finite descriptions André Nies The University of Auckland July 19, 2005 Part 1: FA-presentability A countable structure in a finite signature is finite-automaton presentable (or automatic)
More informationComplete problems for classes in PH, The Polynomial-Time Hierarchy (PH) oracle is like a subroutine, or function in
Oracle Turing Machines Nondeterministic OTM defined in the same way (transition relation, rather than function) oracle is like a subroutine, or function in your favorite PL but each call counts as single
More informationLecture 3: Randomness in Computation
Great Ideas in Theoretical Computer Science Summer 2013 Lecture 3: Randomness in Computation Lecturer: Kurt Mehlhorn & He Sun Randomness is one of basic resources and appears everywhere. In computer science,
More informationOn the average-case complexity of Shellsort
Received: 16 February 2015 Revised: 24 November 2016 Accepted: 1 February 2017 DOI: 10.1002/rsa.20737 RESEARCH ARTICLE On the average-case complexity of Shellsort Paul Vitányi 1,2 1 CWI, Science Park 123,
More informationKolmogorov Complexity with Error
Kolmogorov Complexity with Error Lance Fortnow 1, Troy Lee 2, and Nikolai Vereshchagin 3, 1 University of Chicago, 1100 E. 58th Street, Chicago, IL, USA 60637. fortnow@cs.uchicago.edu, http://people.cs.uchicago.edu/~fortnow
More informationCS294: Pseudorandomness and Combinatorial Constructions September 13, Notes for Lecture 5
UC Berkeley Handout N5 CS94: Pseudorandomness and Combinatorial Constructions September 3, 005 Professor Luca Trevisan Scribe: Gatis Midrijanis Notes for Lecture 5 In the few lectures we are going to look
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 informationUmans Complexity Theory Lectures
Umans Complexity Theory Lectures Lecture 8: Introduction to Randomized Complexity: - Randomized complexity classes, - Error reduction, - in P/poly - Reingold s Undirected Graph Reachability in RL Randomized
More information1 Computational Problems
Stanford University CS254: Computational Complexity Handout 2 Luca Trevisan March 31, 2010 Last revised 4/29/2010 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationA Monad For Randomized Algorithms
A Monad For Randomized Algorithms Tyler Barker Tulane University 1 Domains XII August 26, 2015 1 Supported by AFOSR Tyler Barker Tulane University A Monad For Randomized Algorithms Domains XII August 26,
More informationNon-Approximability Results (2 nd part) 1/19
Non-Approximability Results (2 nd part) 1/19 Summary - The PCP theorem - Application: Non-approximability of MAXIMUM 3-SAT 2/19 Non deterministic TM - A TM where it is possible to associate more than one
More informationEnumerations including laconic enumerators
Enumerations including laconic enumerators Sanjay Jain National University of Singapore sanjay@comp.nus.edu.sg Jason Teutsch TrueBit Foundation jt@truebit.io June 19, 2017 Abstract We show that it is possible,
More informationContents 1 Introduction 2 2 Formal Setting and General Observations Specication : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : :
On the Implementation of Huge Random Objects (Preliminary Version) Oded Goldreich y Sha Goldwasser yz Asaf Nussboim June 8, 2003 Abstract We initiate a general study of pseudo-random implementations of
More informationCompression Complexity
Compression Complexity Stephen Fenner University of South Carolina Lance Fortnow Georgia Institute of Technology February 15, 2017 Abstract The Kolmogorov complexity of x, denoted C(x), is the length of
More informationRandomness and Computation March 13, Lecture 3
0368.4163 Randomness and Computation March 13, 2009 Lecture 3 Lecturer: Ronitt Rubinfeld Scribe: Roza Pogalnikova and Yaron Orenstein Announcements Homework 1 is released, due 25/03. Lecture Plan 1. Do
More informationNotes for Lecture Notes 2
Stanford University CS254: Computational Complexity Notes 2 Luca Trevisan January 11, 2012 Notes for Lecture Notes 2 In this lecture we define NP, we state the P versus NP problem, we prove that its formulation
More informationCMPSCI 311: Introduction to Algorithms Second Midterm Exam
CMPSCI 311: Introduction to Algorithms Second Midterm Exam April 11, 2018. Name: ID: Instructions: Answer the questions directly on the exam pages. Show all your work for each question. Providing more
More informationCS151 Complexity Theory. Lecture 14 May 17, 2017
CS151 Complexity Theory Lecture 14 May 17, 2017 IP = PSPACE Theorem: (Shamir) IP = PSPACE Note: IP PSPACE enumerate all possible interactions, explicitly calculate acceptance probability interaction extremely
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 informationTwo Query PCP with Sub-Constant Error
Electronic Colloquium on Computational Complexity, Report No 71 (2008) Two Query PCP with Sub-Constant Error Dana Moshkovitz Ran Raz July 28, 2008 Abstract We show that the N P-Complete language 3SAT has
More informationTuring Degrees and Definability of the Jump. Theodore A. Slaman. University of California, Berkeley. CJuly, 2005
Turing Degrees and Definability of the Jump Theodore A. Slaman University of California, Berkeley CJuly, 2005 Outline Lecture 1 Forcing in arithmetic Coding and decoding theorems Automorphisms of countable
More informationLecture 20: conp and Friends, Oracles in Complexity Theory
6.045 Lecture 20: conp and Friends, Oracles in Complexity Theory 1 Definition: conp = { L L NP } What does a conp computation look like? In NP algorithms, we can use a guess instruction in pseudocode:
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 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 informationDefinability of Recursive Predicates in the Induced Subgraph Order
Definability of Recursive Predicates in the Induced Subgraph Order Ramanathan S. Thinniyam Institute of Mathematical Sciences, Chennai ICLA, January 5, 2017 Outline 1. Introduction to graph orders. 2.
More informationHandout 5. α a1 a n. }, where. xi if a i = 1 1 if a i = 0.
Notes on Complexity Theory Last updated: October, 2005 Jonathan Katz Handout 5 1 An Improved Upper-Bound on Circuit Size Here we show the result promised in the previous lecture regarding an upper-bound
More informationCountability Sets of Measure Zero Random Reals Normal Numbers There s a Bear in There. The Real Thing. Paul McCann. Wednesday, 3 August, 2011
Wednesday, 3 August, 2011 Outline Countability 1 Countability 2 3 4 5 Counting with the Natural Numbers A set S is countable if there is a function f from N onto S. That is, we can label each s S by a
More information6.842 Randomness and Computation Lecture 5
6.842 Randomness and Computation 2012-02-22 Lecture 5 Lecturer: Ronitt Rubinfeld Scribe: Michael Forbes 1 Overview Today we will define the notion of a pairwise independent hash function, and discuss its
More informationLecture 22: Quantum computational complexity
CPSC 519/619: Quantum Computation John Watrous, University of Calgary Lecture 22: Quantum computational complexity April 11, 2006 This will be the last lecture of the course I hope you have enjoyed the
More informationComplexity Theory VU , SS The Polynomial Hierarchy. Reinhard Pichler
Complexity Theory Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität Wien 15 May, 2018 Reinhard
More informationOutline. Complexity Theory EXACT TSP. The Class DP. Definition. Problem EXACT TSP. Complexity of EXACT TSP. Proposition VU 181.
Complexity Theory Complexity Theory Outline Complexity Theory VU 181.142, SS 2018 6. The Polynomial Hierarchy Reinhard Pichler Institut für Informationssysteme Arbeitsbereich DBAI Technische Universität
More informationPseudorandom Generators
8 Pseudorandom Generators Great Ideas in Theoretical Computer Science Saarland University, Summer 2014 andomness is one of the fundamental computational resources and appears everywhere. In computer science,
More informationChapter 2 Date Compression: Source Coding. 2.1 An Introduction to Source Coding 2.2 Optimal Source Codes 2.3 Huffman Code
Chapter 2 Date Compression: Source Coding 2.1 An Introduction to Source Coding 2.2 Optimal Source Codes 2.3 Huffman Code 2.1 An Introduction to Source Coding Source coding can be seen as an efficient way
More informationPermutations and Combinations
Permutations and Combinations Permutations Definition: Let S be a set with n elements A permutation of S is an ordered list (arrangement) of its elements For r = 1,..., n an r-permutation of S is an ordered
More informationPCP Theorem and Hardness of Approximation
PCP Theorem and Hardness of Approximation An Introduction Lee Carraher and Ryan McGovern Department of Computer Science University of Cincinnati October 27, 2003 Introduction Assuming NP P, there are many
More informationLecture 59 : Instance Compression and Succinct PCP s for NP
IITM-CS6840: Advanced Complexity Theory March 31, 2012 Lecture 59 : Instance Compression and Succinct PCP s for NP Lecturer: Sivaramakrishnan N.R. Scribe: Prashant Vasudevan 1 Introduction Classical Complexity
More informationAdvanced topic: Space complexity
Advanced topic: Space complexity CSCI 3130 Formal Languages and Automata Theory Siu On CHAN Chinese University of Hong Kong Fall 2016 1/28 Review: time complexity We have looked at how long it takes to
More informationTheory of Computation
Theory of Computation Dr. Sarmad Abbasi Dr. Sarmad Abbasi () Theory of Computation 1 / 33 Lecture 20: Overview Incompressible strings Minimal Length Descriptions Descriptive Complexity Dr. Sarmad Abbasi
More informationSimple extractors via crypto pseudo-random generators
Simple extractors via crypto pseudo-random generators Marius Zimand (Towson University) Extractors vs. Pseudo-Rand. Generators Fundamental primitives in derandomization, cryptography,... They manufacture
More informationChapter 7 Randomization Algorithm Theory WS 2017/18 Fabian Kuhn
Chapter 7 Randomization Algorithm Theory WS 2017/18 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization
More informationLecture 5: Pseudo-Random Generators and Pseudo-Random Functions
CS 276 Cryptography Sept 22, 2014 Lecture 5: Pseudo-Random Generators and Pseudo-Random Functions Instructor: Sanjam Garg Scribe: Peihan Miao 1 PRG (Pseudo-Random Generator) extension In this section we
More informationLecture 5. 1 Review (Pairwise Independence and Derandomization)
6.842 Randomness and Computation September 20, 2017 Lecture 5 Lecturer: Ronitt Rubinfeld Scribe: Tom Kolokotrones 1 Review (Pairwise Independence and Derandomization) As we discussed last time, we can
More informationApplications of Kolmogorov Complexity to Graphs
Applications of Kolmogorov Complexity to Graphs John Hearn Ran Libeskind-Hadas, Advisor Michael Orrison, Reader May, 2006 Department of Mathematics Copyright 2006 John Hearn. The author grants Harvey Mudd
More informationSimulating classical circuits with quantum circuits. The complexity class Reversible-P. Universal gate set for reversible circuits P = Reversible-P
Quantum Circuits Based on notes by John Watrous and also Sco8 Aaronson: www.sco8aaronson.com/democritus/ John Preskill: www.theory.caltech.edu/people/preskill/ph229 Outline Simulating classical circuits
More informationconp = { L L NP } (1) This problem is essentially the same as SAT because a formula is not satisfiable if and only if its negation is a tautology.
1 conp and good characterizations In these lecture notes we discuss a complexity class called conp and its relationship to P and NP. This discussion will lead to an interesting notion of good characterizations
More informationLecture 16: Time Complexity and P vs NP
6.045 Lecture 16: Time Complexity and P vs NP 1 Time-Bounded Complexity Classes Definition: TIME(t(n)) = { L there is a Turing machine M with time complexity O(t(n)) so that L = L(M) } = { L L is a language
More informationNP-Completeness. f(n) \ n n sec sec sec. n sec 24.3 sec 5.2 mins. 2 n sec 17.9 mins 35.
NP-Completeness Reference: Computers and Intractability: A Guide to the Theory of NP-Completeness by Garey and Johnson, W.H. Freeman and Company, 1979. NP-Completeness 1 General Problems, Input Size and
More informationHarvard CS 121 and CSCI E-121 Lecture 20: Polynomial Time
Harvard CS 121 and CSCI E-121 Lecture 20: Polynomial Time Harry Lewis November 12, 20123 Review of Asymptotic Notation For f, g : N R + f = O(g): c > 0 s.t. f(n) c g(n) for all sufficiently large n. f
More informationTen years of triviality
Ten years of triviality André Nies U of Auckland The Incomputable, Chicheley Hall, 2012 André Nies (U of Auckland) Ten years of triviality The Incomputable 1 / 19 K-trivials: synopsis During the last 10
More information1 PSPACE-Completeness
CS 6743 Lecture 14 1 Fall 2007 1 PSPACE-Completeness Recall the NP-complete problem SAT: Is a given Boolean formula φ(x 1,..., x n ) satisfiable? The same question can be stated equivalently as: Is the
More informationLecture 8: Complete Problems for Other Complexity Classes
IAS/PCMI Summer Session 2000 Clay Mathematics Undergraduate Program Basic Course on Computational Complexity Lecture 8: Complete Problems for Other Complexity Classes David Mix Barrington and Alexis Maciel
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 informationLecture 9: Counting Matchings
Counting and Sampling Fall 207 Lecture 9: Counting Matchings Lecturer: Shayan Oveis Gharan October 20 Disclaimer: These notes have not been subjected to the usual scrutiny reserved for formal publications.
More informationCMPSCI 250: Introduction to Computation. Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013
CMPSCI 250: Introduction to Computation Lecture #11: Equivalence Relations David Mix Barrington 27 September 2013 Equivalence Relations Definition of Equivalence Relations Two More Examples: Universal
More informationDynamic Programming. Shuang Zhao. Microsoft Research Asia September 5, Dynamic Programming. Shuang Zhao. Outline. Introduction.
Microsoft Research Asia September 5, 2005 1 2 3 4 Section I What is? Definition is a technique for efficiently recurrence computing by storing partial results. In this slides, I will NOT use too many formal
More informationRandomness and Complexity of Sequences over Finite Fields. Harald Niederreiter, FAMS. RICAM Linz and University of Salzburg (Austria)
Randomness and Complexity of Sequences over Finite Fields Harald Niederreiter, FAMS RICAM Linz and University of Salzburg (Austria) Introduction A hierarchy of complexities Complexity and random sequences
More informationChapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn
Chapter 6 Randomization Algorithm Theory WS 2012/13 Fabian Kuhn Randomization Randomized Algorithm: An algorithm that uses (or can use) random coin flips in order to make decisions We will see: randomization
More informationSimulation of quantum computers with probabilistic models
Simulation of quantum computers with probabilistic models Vlad Gheorghiu Department of Physics Carnegie Mellon University Pittsburgh, PA 15213, U.S.A. April 6, 2010 Vlad Gheorghiu (CMU) Simulation of quantum
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 informationLimits to Approximability: When Algorithms Won't Help You. Note: Contents of today s lecture won t be on the exam
Limits to Approximability: When Algorithms Won't Help You Note: Contents of today s lecture won t be on the exam Outline Limits to Approximability: basic results Detour: Provers, verifiers, and NP Graph
More informationMeasures of relative complexity
Measures of relative complexity George Barmpalias Institute of Software Chinese Academy of Sciences and Visiting Fellow at the Isaac Newton Institute for the Mathematical Sciences Newton Institute, January
More informationAntipodal Gray Codes
Antipodal Gray Codes Charles E Killian, Carla D Savage,1 Department of Computer Science N C State University, Box 8206 Raleigh, NC 27695, USA Abstract An n-bit Gray code is a circular listing of the 2
More informationAlgorithmic Probability
Algorithmic Probability From Scholarpedia From Scholarpedia, the free peer-reviewed encyclopedia p.19046 Curator: Marcus Hutter, Australian National University Curator: Shane Legg, Dalle Molle Institute
More informationCSE525: Randomized Algorithms and Probabilistic Analysis April 2, Lecture 1
CSE525: Randomized Algorithms and Probabilistic Analysis April 2, 2013 Lecture 1 Lecturer: Anna Karlin Scribe: Sonya Alexandrova and Eric Lei 1 Introduction The main theme of this class is randomized algorithms.
More informationA Tutorial on Computational Learning Theory Presented at Genetic Programming 1997 Stanford University, July 1997
A Tutorial on Computational Learning Theory Presented at Genetic Programming 1997 Stanford University, July 1997 Vasant Honavar Artificial Intelligence Research Laboratory Department of Computer Science
More information34.1 Polynomial time. Abstract problems
< Day Day Up > 34.1 Polynomial time We begin our study of NP-completeness by formalizing our notion of polynomial-time solvable problems. These problems are generally regarded as tractable, but for philosophical,
More informationDRAFT. PCP and Hardness of Approximation. Chapter 19
Chapter 19 PCP and Hardness of Approximation...most problem reductions do not create or preserve such gaps...to create such a gap in the generic reduction (cf. Cook)...also seems doubtful. The intuitive
More informationc 1999 Society for Industrial and Applied Mathematics
SIAM J. COMPUT. Vol. 9, No., pp. 590 599 c 1999 Society for Industrial and Applied Mathematics KOLMOGOROV RANDOM GRAPHS AND THE INCOMPRESSIBILITY METHOD HARRY BUHRMAN, MING LI, JOHN TROMP, AND PAUL VITÁNYI
More informationLecture 17. In this lecture, we will continue our discussion on randomization.
ITCS:CCT09 : Computational Complexity Theory May 11, 2009 Lecturer: Jayalal Sarma M.N. Lecture 17 Scribe: Hao Song In this lecture, we will continue our discussion on randomization. 1 BPP and the Polynomial
More information