Topological nonexistence results in complexity theory and combinatorics L szl Lov sz Microsoft Research One Micros

Mar 24, 2012

270 likes | 494 Views

Lower bounds on complexity of algorithmsnon-existence of efficient algorithms. - define measure of complexity of instance. - it is high on appropriate instances. it is low on instances where algorithm works efficiently . topology provides such measures!. Decision trees. Boolean function. Example: tournament diagnostic.

Share Presentation

Embed Code

Link

lelia

Download Presentation

Topological nonexistence results in complexity theory and combinatorics L szl Lov sz Microsoft Research One Micros

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

1. CimCim

Some applications of graph theory, combinatorics and number theory

Gregory Gutin Department of Computer Science. Some applications of graph theory, combinatorics and number theory. Two Parts of the Talk. Graph-Theoretical Approach to Level of Repair Analysis (joint work with A. Rafiey, A. Yeo and M. Tso, Man. U .)

882 views • 20 slides

Complexity Theory

Complexity Theory. A light introduction to a rather important and complex topic. October 12, 2007 Presented by Sean Szumlanski. Programme. Graph coloring: a practical application This problem will serve as our touchstone throughout the

596 views • 17 slides

Barriers in Cryptography and Complexity Theory

Barriers in Cryptography and Complexity Theory. Boaz Barak. TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A A A A A A A A A A A A A A A A A A A A A A A. What is a barrier?. What we know. Grand Goal. Family of known techniques. F :. Parity  AC 0.

504 views • 29 slides

Complexity Theory

Complexity Theory. Lab Meeting - 11/07/2007. Nathan Young. NECSI Summer Course. Complexity Overview. Emergence: How do local behaviors relate to macroscopic behavior?. Interdependence: What happens when you move/or remove a component of a multi-component system?. Complexity Theory.

1.88k views • 25 slides

Polynomials in Complexity Theory

Polynomials in Complexity Theory. Swastik Kopparty (Rutgers). Plan. Three amazing applications of polynomials Secrets + Secure multiparty computation Lower bounds on constant depth circuits Checking proofs Along the way Some morals. Polynomial refresher. Field F

426 views • 30 slides

Topological Graph Theory

David Craft. Topological Graph Theory. Mathematics Combinatorics Graph Theory Topological Graph Theory. A graph is a set of vertices (or points). A graph is a set of vertices (or points). together with a set of vertex-pairs called edges . .

1.03k views • 18 slides

Nonlinear methods in discrete optimization L á szl ó Lov á sz

Nonlinear methods in discrete optimization L á szl ó Lov á sz Eötvös Loránd University, Budapest lovasz@cs.elte.hu. Every simple planar graph can be drawn in the plane with straight edges. Fáry-Wagner. planar graph. Exercise 1 : Prove this.

484 views • 36 slides

CS151 Complexity Theory

CS151 Complexity Theory. Lecture 9 April 30, 2013. The BMY Generator. Recall goal: for all 1 > δ > 0, family of PRGs {G m } with output length m fooling size s = m seed length t = m δ running time m c error ε < 1/6

632 views • 44 slides

CS151 Complexity Theory

CS151 Complexity Theory. Lecture 18 May 30, 2013. Approaches to open problems. Almost all major open problems we have seen entail proving lower bounds P ≠ NP - P = BPP * L ≠ P - NP = AM * P ≠ PSPACE NC proper BPP ≠ EXP PH proper EXP * P/poly.

607 views • 47 slides

Microsoft Collaboration Survey Research Results

Microsoft Collaboration Survey Research Results. Survey of Business and Technology Decision-Makers. Survey Methodology. Executive Summary. Executive Summary: Collaboration Tools.

360 views • 23 slides

CS151 Complexity Theory

CS151 Complexity Theory. Lecture 14 May 16, 2013. Interactive Proofs. interactive proof system for L is an interactive protocol (P, V). common input: x. Prover. Verifier. # rounds = poly(|x|). accept/reject. Interactive Proofs.

602 views • 40 slides

CS151 Complexity Theory

CS151 Complexity Theory. Lecture 4 April 8, 2004. Introduction. cover up nodes with c colors promise: never color “arrow” same as “blank” determine which kind of tree in poly(n, c) steps?. A puzzle: two kinds of trees. depth n. A puzzle. depth n. A puzzle. depth n. Introduction.

507 views • 34 slides

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com. Every 3-connected planar graph is the skeleton of a convex 3-polytope. Steinitz 1922. 3-connected planar graph.

390 views • 26 slides

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com. Every planar graph can be drawn in the plane with straight edges. Fáry-Wagner. planar graph. Every 3-connected planar graph

432 views • 35 slides

Complexity Theory in Practice

Complexity Theory in Practice. The Power of Randomization Speaker: He Yan November 17, 2008. Introduction (Traditional Algorithms). Traditional algorithms have the following properties: They are always correct They are always precise-- the answer is not given as a range

549 views • 41 slides

Analysis of Boolean Functions and Complexity Theory Economics Combinatorics …

Analysis of Boolean Functions and Complexity Theory Economics Combinatorics …. Introduction. Objectives : To introduce Analysis of Boolean Functions and some of its applications. Overview : Basic definitions. First passage percolation Mechanism design Graph property … And more….

552 views • 54 slides

The Mathematical Challenge of Large Networks L á szl ó Lov á sz

The Mathematical Challenge of Large Networks L á szl ó Lov á sz Eötvös Loránd University, Budapest lovasz@cs.elte.hu. Very large graphs Questions. What properties to study? - Does it have an even number of nodes? - How dense is it (average degree) ? - Is it connected?

342 views • 33 slides

Visual and Logical Beauty in Mathematics L á szl ó Lov á sz Eötvös Loránd University, Budapest

Visual and Logical Beauty in Mathematics L á szl ó Lov á sz Eötvös Loránd University, Budapest lovasz@cs.elte.hu. Quote from a mathematician. The mathematician's patterns, like the painter's or the poet's must be beautiful; the ideas, like the colors or the words

209 views • 20 slides

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research

Eigenvalues and geometric representations of graphs L á szl ó Lov á sz Microsoft Research One Microsoft Way, Redmond, WA 98052 lovasz@microsoft.com. Adjacency matrix:. Laplacian:. Matrices associated with graphs. (all graphs connected). Adjacency matrix:. Laplacian:.

239 views • 22 slides

More Related