the tutte polynomial and a bijection between subgraphs
play

The Tutte polynomial and a bijection between subgraphs and - PowerPoint PPT Presentation

May 26, 2023 •148 likes •1.17k views

The Tutte polynomial and a bijection between subgraphs and orientations Olivier Bernardi - CRM Combinatorics Seminar at CRM, October 2006, Barcelona Content of the talk The Tutte Polynomial and its specializations A new characterization of the

  1. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  2. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  3. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  4. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  5. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  6. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  7. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.15/31

  8. The tour of a spanning tree Start from the root. Iterate the move : External half-edge = ⇒ Turn . Internal half-edge = ⇒ Cross + turn . Example : CRM, October 2006 Olivier Bernardi - CRM – p.15/31

  9. Tour: graphical interpretation CRM, October 2006 Olivier Bernardi - CRM – p.16/31

  10. Activities of spanning trees CRM, October 2006 ▽ Olivier Bernardi - CRM – p.17/31

  11. Activities of spanning trees Consider the order of appearance of the edges around the tree. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.17/31

  12. Activities of spanning trees 5 6 3 4 2 1 Consider the order of appearance of the edges around the tree. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.17/31

  13. Activities of spanning trees 5 6 3 4 2 1 Consider the order of appearance of the edges around the tree. An internal/external edge is active if it is minimal in its fundamental cocycle/cycle. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.17/31

  14. Activities of spanning trees 5 6 3 4 2 1 Consider the order of appearance of the edges around the tree. We denote by: • i ( A ) the number of internal active edges, • e ( A ) the number of external active edges. CRM, October 2006 Olivier Bernardi - CRM – p.17/31

  15. Tutte polynomial Theorem [B.] : The Tutte polynomial is equal to : � x i ( T ) y e ( T ) . T G ( x, y ) = T spanning tree CRM, October 2006 ▽ Olivier Bernardi - CRM – p.18/31

  16. Tutte polynomial Theorem [B.] : The Tutte polynomial is equal to : � x i ( T ) y e ( T ) . T G ( x, y ) = T spanning tree Example : T K 3 ( x, y ) = x 2 + x + y. x 2 T K 3 ( x, y ) = + + x y CRM, October 2006 ▽ Olivier Bernardi - CRM – p.18/31

  17. Tutte polynomial Theorem [B.] : The Tutte polynomial is equal to : � x i ( T ) y e ( T ) . T G ( x, y ) = T spanning tree Subgraph expansion [Brylawsky] : � ( x − 1) c ( S ) − 1 ( y − 1) | S | + c ( S ) −| V | . T G ( x, y ) = S ⊆ G CRM, October 2006 Olivier Bernardi - CRM – p.18/31

  18. From spanning trees to subgraphs CRM, October 2006 ▽ Olivier Bernardi - CRM – p.19/31

  19. From spanning trees to subgraphs CRM, October 2006 ▽ Olivier Bernardi - CRM – p.19/31

  20. From spanning trees to subgraphs T + T T − CRM, October 2006 Olivier Bernardi - CRM – p.19/31

  21. Partition of the subgraphs 2 E = � [ T − ; T + ] Proposition [B.] : T spanning tree CRM, October 2006 ▽ Olivier Bernardi - CRM – p.20/31

  22. Partition of the subgraphs 2 E = � [ T − ; T + ] Proposition [B.] : T spanning tree Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.20/31

  23. Partition of the subgraphs 2 E = � [ T − ; T + ] Proposition [B.] : T spanning tree Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.20/31

  24. Partition of the subgraphs 2 E = � [ T − ; T + ] Proposition [B.] : T spanning tree Proposition [B.] : ( x − 1) c ( S ) − 1 ( y − 1) | S | + c ( S ) −| V | = x i ( T ) y e ( T ) � S ∈ [ T − ,T + ] CRM, October 2006 Olivier Bernardi - CRM – p.20/31

  25. Bijection subgraphs ⇐ ⇒ orientations CRM, October 2006 Olivier Bernardi - CRM – p.21/31

  26. Φ : Subgraphs �→ Orientations For spanning trees: CRM, October 2006 ▽ Olivier Bernardi - CRM – p.22/31

  27. Φ : Subgraphs �→ Orientations For spanning trees: Internal edges are oriented from father to son. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.22/31

  28. Φ : Subgraphs �→ Orientations For spanning trees: Internal edges are oriented from father to son. External edges are oriented in such a way their heads appear before their tails around the tree. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.22/31

  29. Φ : Subgraphs �→ Orientations For spanning trees: Internal edges are oriented from father to son. External edges are oriented in such a way their heads appear before their tails around the tree. CRM, October 2006 Olivier Bernardi - CRM – p.22/31

  30. Activity et acyclicity Remark : The fundamental cycle of an external active edge is oriented. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.23/31

  31. Activity et acyclicity Remark : The fundamental cycle of an external active edge is oriented. Hence, Φ( T ) acyclic = ⇒ T internal. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.23/31

  32. Activity et acyclicity Remark : The fundamental cycle of an external active edge is oriented. Hence, Φ( T ) acyclic ⇐ ⇒ T internal. CRM, October 2006 Olivier Bernardi - CRM – p.23/31

  33. Activity et strong connectivity Remark : The fundamental cocycle of an internal active edge is oriented. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.24/31

  34. Activity et strong connectivity Remark : The fundamental cocycle of an internal active edge is oriented. Hence, Φ( T ) strongly connected = ⇒ T external. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.24/31

  35. Activity et strong connectivity Remark : The fundamental cocycle of an internal active edge is oriented. Hence, Φ( T ) strongly connected ⇐ ⇒ T external. CRM, October 2006 Olivier Bernardi - CRM – p.24/31

  36. Φ : Subgraphs �→ Orientations For any subgraph S : Φ ? CRM, October 2006 ▽ Olivier Bernardi - CRM – p.25/31

  37. Φ : Subgraphs �→ Orientations For any subgraph S : The subgraph S is in an interval [ T − , T + ] . Φ ? Φ CRM, October 2006 ▽ Olivier Bernardi - CRM – p.25/31

  38. Φ : Subgraphs �→ Orientations For any subgraph S : The subgraph S is in an interval [ T − , T + ] . Reverse the fundamental cycle/cocycle of the edges in T △ S . Φ Φ CRM, October 2006 Olivier Bernardi - CRM – p.25/31

  39. Φ : Subgraphs �→ Orientations Theorem [B.] : For any graph G , the mapping Φ establishes a bijection between subgraphs and orientations. CRM, October 2006 ▽ Olivier Bernardi - CRM – p.26/31

  40. Φ : Subgraphs �→ Orientations Theorem [B.] : For any graph G , the mapping Φ establishes a bijection between subgraphs and orientations. Example : CRM, October 2006 ▽ Olivier Bernardi - CRM – p.26/31

  41. Φ : Subgraphs �→ Orientations Theorem [B.] : For any graph G , the mapping Φ establishes a bijection between subgraphs and orientations. Example : CRM, October 2006 Olivier Bernardi - CRM – p.26/31

  42. Specializations Subgraphs Orientations general root- connected strongly connected general connectedexternal general mal general forest mini internal acyclic CRM, October 2006 Olivier Bernardi - CRM – p.27/31

  43. Specializations Connected: T G (1 , 2) CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  44. Specializations Connected: T G (1 , 2) :Root-connected . CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  45. Specializations External: T G (0 , 2) CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  46. Specializations External: T G (0 , 2) :Strongly-connected . CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  47. Specializations Forests: T G (2 , 1) CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  48. Specializations Forests: T G (2 , 1) :Minimal ( ⇐ ⇒ score vectors). CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  49. Specializations Internal: T G (2 , 0) CRM, October 2006 ▽ Olivier Bernardi - CRM – p.28/31

  50. Specializations Internal: T G (2 , 0) :Acyclic . CRM, October 2006 Olivier Bernardi - CRM – p.28/31

  51. Specializations Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: CRM, October 2006 ▽ Olivier Bernardi - CRM – p.29/31

  52. Specializations Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Connected subgraphs and root-connected orientations. T G (1 , 2) [Gioan 06] CRM, October 2006 ▽ Olivier Bernardi - CRM – p.29/31

  53. Specializations Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Connected subgraphs and root-connected orientations. T G (1 , 2) [Gioan 06] • Forests and minimal orientations ( ⇐ ⇒ score vectors). T G (2 , 1) [Stanley 80] CRM, October 2006 ▽ Olivier Bernardi - CRM – p.29/31

  54. Specializations Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Connected subgraphs and root-connected orientations. T G (1 , 2) [Gioan 06] • Forests and minimal orientations ( ⇐ ⇒ score vectors). T G (2 , 1) [Stanley 80] • Trees and minimal root-connected orientations ( ⇐ ⇒ root-connected score vectors). T G (1 , 1) [Gioan 06] CRM, October 2006 Olivier Bernardi - CRM – p.29/31

  55. Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Internal subgraphs and acyclic orientations. T G (2 , 0) [Winder 66, Stanley 73, Gessel & Sagan 96] CRM, October 2006 ▽ Olivier Bernardi - CRM – p.30/31

  56. Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Internal subgraphs and acyclic orientations. T G (2 , 0) [Winder 66, Stanley 73, Gessel & Sagan 96] • External subgraphs and strongly-connected orientations. T G (0 , 2) [Las Vergnas 84, Gioan & Las Vergnas 06] CRM, October 2006 ▽ Olivier Bernardi - CRM – p.30/31

  57. Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Internal subgraphs and acyclic orientations. T G (2 , 0) [Winder 66, Stanley 73, Gessel & Sagan 96] • External subgraphs and strongly-connected orientations. T G (0 , 2) [Las Vergnas 84, Gioan & Las Vergnas 06] • Internal trees and acyclic root-connected orientations. T G (1 , 0) [Greene & Zaslavsky 83, Gessel & Sagan 96, Gebhard & Sagan 00] CRM, October 2006 ▽ Olivier Bernardi - CRM – p.30/31

  58. Theorem [B.] : For any graph G , the mapping Φ induces a bijection between: • Internal subgraphs and acyclic orientations. T G (2 , 0) [Winder 66, Stanley 73, Gessel & Sagan 96] • External subgraphs and strongly-connected orientations. T G (0 , 2) [Las Vergnas 84, Gioan & Las Vergnas 06] • Internal trees and acyclic root-connected orientations. T G (1 , 0) [Greene & Zaslavsky 83, Gessel & Sagan 96, Gebhard & Sagan 00] • External trees and minimal strongly-connected orientations ( ⇐ ⇒ strongly-connected score vectors). T G (0 , 1) [Gioan 06] CRM, October 2006 Olivier Bernardi - CRM – p.30/31

Recommend

The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint

The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint

The Complexity of Computing the Sign of the Tutte Polynomial Leslie Ann Goldberg (based on joint work with Mark Jerrum) Oxford Algorithms Workshop, October 2012 The Tutte polynomial of a graph G = ( V , E ) ( x 1 ) ( V , A ) (

429 views • 23 slides
The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids Emeric Gioan

The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids Emeric Gioan

A survey on The Active Bijection in Graphs, Hyperplane Arrangements, and Oriented Matroids Emeric Gioan CNRS, LIRMM, Universit e de Montpellier, France Joint work with Michel Las Vergnas Workshop on New Directions for the Tutte Polynomial,

864 views • 63 slides
The Tutte polynomial, its applications and generalizations Sergei Chmutov The Ohio State

The Tutte polynomial, its applications and generalizations Sergei Chmutov The Ohio State

University of South Alabama The Tutte polynomial, its applications and generalizations Sergei Chmutov The Ohio State University, Mansfield Thursday, April 15, 2010 3:30 4:30 p.m. Chromatic polynomial C ( q ) := # of proper colorings of

249 views • 13 slides
Matroids, graphs in surfaces, and the Tutte polynomial 2016 International Workshop on Structure

Matroids, graphs in surfaces, and the Tutte polynomial 2016 International Workshop on Structure

Matroids, graphs in surfaces, and the Tutte polynomial 2016 International Workshop on Structure in Graphs and Matroids Iain Moffatt and Ben Smith Royal Holloway, University of London Eindhoven, 29 th July 2016 Overview T utte polynomial T

435 views • 21 slides
Where do topological Tutte polynomial come from? Iain Moffatt Carolyn Chun, Jo Ellis-Monaghan,

Where do topological Tutte polynomial come from? Iain Moffatt Carolyn Chun, Jo Ellis-Monaghan,

Where do topological Tutte polynomial come from? Iain Moffatt Carolyn Chun, Jo Ellis-Monaghan, Thomas Krajewski, Steve Noble, Ralf Rueckriemen, Ben Smith, Adrian Tanasa Royal Holloway, University of London Dagstuhl, 13 th June 2016 A review of

213 views • 18 slides
G- Tutte polynomial and Lie Abelian arrangements group ( Hokkaido . ) Masahiko Yoshinaga

G- Tutte polynomial and Lie Abelian arrangements group ( Hokkaido . ) Masahiko Yoshinaga

FJV 17/09/2018 2018 Nha Trang . G- Tutte polynomial and Lie Abelian arrangements group ( Hokkaido . ) Masahiko Yoshinaga V ) ( Based joint work 04551 1707 arXiv : on . Tran Ye Liu and Tan what with . relationship

798 views • 34 slides
AN INTRODUCTION TO TRANSITION POLYNOMIALS Jo Ellis-Monaghan The story There are

AN INTRODUCTION TO TRANSITION POLYNOMIALS Jo Ellis-Monaghan The story There are

AN INTRODUCTION TO TRANSITION POLYNOMIALS Jo Ellis-Monaghan The story There are deletion-contraction polynomials. The Tutte polynomial assimilates them all. There are many generalizations of the Tutte polynomial to adapt it to

471 views • 23 slides
Statement Problem A: Bijection In this problem, you have to establish a bijection between

Statement Problem A: Bijection In this problem, you have to establish a bijection between

Problem A: Bijection Statement Statement Problem A: Bijection In this problem, you have to establish a bijection between combinations and pairs of a regular bracket sequence and an integer. Ivan Kazmenko (SPb SU) Problem Analysis 28.01.2020

2.1k views • 181 slides
Polynomial Chi-binding functions and forbidden induced subgraphs a survey Ingo Schiermeyer TU

Polynomial Chi-binding functions and forbidden induced subgraphs a survey Ingo Schiermeyer TU

Polynomial Chi-binding functions and forbidden induced subgraphs a survey Ingo Schiermeyer TU Bergakademie Freiberg Chromatic Number Ingo Schiermeyer GGTW 2019 Chromatic Number Andrs Gyrfs (Budapest, 1985) Problems from the world

337 views • 29 slides
Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work

Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work

Finding Tutte Paths in Linear Time Philipp Kindermann Universit at W urzburg joint work with Therese Biedl University of Waterloo Tutte Paths Planar graph G Tutte Paths X Planar graph G Tutte Paths X Planar graph G Y Tutte Paths X

1.95k views • 181 slides
Chnotourg first formulation select each edge to either benthegraph ornotathegraphortuits dual

Chnotourg first formulation select each edge to either benthegraph ornotathegraphortuits dual

Chomutov Polynomial 50010.1 Towards a Symmetric Tutte Polynomial Chnotourg first formulation select each edge to either benthegraph ornotathegraphortuits dual Assign to each connected componentiealabelan the original graph org nthe dual graph

145 views • 12 slides
Polynomial graph and matroid invariants from graph homomorphisms Delia Garijo 1 Andrew Goodall 2

Polynomial graph and matroid invariants from graph homomorphisms Delia Garijo 1 Andrew Goodall 2

Counting graph homomorphisms Sequences giving graph polynomials Cycle matroid invariants From B -tensions and B -flows to a B -Tutte? Beyond polynomials? Open problems Polynomial graph and matroid invariants from graph homomorphisms Delia

1.29k views • 86 slides
Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins

Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins

Bijections for maps: Beautiful and Powerful Part B: Mullin type bijections B.I Mullin bijection and Sheffieldburger paradigm Mullins bijection Def. A tree-decorated map is a map with a marked spanning tree. Mullins bijection Def. A

1.62k views • 134 slides
A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010

A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010

A bijection between cores and dominant Shi regions S. Fishel, M. Vazirani August 6, 2010 arXiv:0904.3118 [math.CO] To appear in European Journal of Combinatorics Introduction The bijection Sketch of sketch of proof Refinements 1/48 Set-up

993 views • 50 slides
The Tutte Institute for The Tutte Institute for Mathematics and Computing Mathematics and

The Tutte Institute for The Tutte Institute for Mathematics and Computing Mathematics and

The Tutte Institute for The Tutte Institute for Mathematics and Computing Mathematics and Computing (TIMC) (TIMC) Dr. Hugh Williams Dr. Hugh Williams Director, TIMC Communications Security Communications Security Establishment Canada

580 views • 24 slides
3 with gcd ( a , b ) = 1 . Consider pairs of natural numbers: N N Infinite

3 with gcd ( a , b ) = 1 . Consider pairs of natural numbers: N N Infinite

CS70 Countability More fractions? Cantor Size: A and B have the same size if there is a bijection between A and B . Are rationals countable. A set is countable if there is a bijection from A to a subset of Enumerate the rational numbers in

317 views • 5 slides
A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI

A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI

6 6 6 6 6 6 6 6 6 Introduction The bijection A simple explicit bijection between ( n , 2 ) Gog and Magog trapezoids Jrmie B ETTINELLI March 7, 2016 Jrmie B ETTINELLI A simple explicit bijection between ( n , 2 ) Gog and Magog

1.02k views • 56 slides
A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

A What is |A|? B Solution: 0 3x+4 1000 iff -4/3 x 996/3 a 1 injection

Section 2.4: Countability a 1 We can compare the cardinality of two sets. |A| = |B| means there is a bijection b bijection 2 between A and B. c 3 |A| |B| means there is an injection from A to B. d 4 |A| < |B| means |A| |B|

547 views • 15 slides
A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN,

A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN,

A new bijection on m -Dyck paths and application to random sampling Axel Bacher LIPN, Universit Paris 13 June 3rd, 2016 Outline Introduction 1 The folding bijection 2 m -ukasiewicz paths and m -Dyck prefixes Folding and unfolding

924 views • 38 slides
A bijection between fractional trees and d -angulations Marie Albenque and Dominique Poulalhon

A bijection between fractional trees and d -angulations Marie Albenque and Dominique Poulalhon

A bijection between fractional trees and d -angulations Marie Albenque and Dominique Poulalhon LIX CNRS Young workshop in arithmetics and combinatorics June, 22th 2011 Albenque & Poulalhon (LIX CNRS) Bijection for d -angulations

658 views • 52 slides
CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2

CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2

CS70: Lecture 11. Outline. 1. RSA system (continued) 1.1 Correctness: Fermats Theorem. 1.2 Construction. 2. Signature Schemes. 3. Warnings. Bijections Bijection is one to one and onto. Bijection: Bijections Bijection is one to one and

2.96k views • 198 slides
Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu

Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu

Planar Induced Subgraphs of Sparse Graphs Glencora Borradaile, David Eppstein , and Pingan Zhu Graph Drawing 2014 The planarization problem Goal: find big planar subgraphs in nonplanar graphs Equivalently: delete as little as possible so the

397 views • 17 slides
Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of

Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of

Polynomial Time corresponds to Solutions of Polynomial Ordinary Differential Equations of Polynomial Length Olivier Bournez, Daniel Graa and Amaury Pouly July 13, 2015 Main result and consequences Theorem (Informal) PTIME = PIVP of

633 views • 47 slides
Polynomial Hierarchy A polynomial-bounded version of Kleenes Arithmetic Hierarchy becomes

Polynomial Hierarchy A polynomial-bounded version of Kleenes Arithmetic Hierarchy becomes

Polynomial Hierarchy A polynomial-bounded version of Kleenes Arithmetic Hierarchy becomes trivial if P = NP . Karp, 1972 Computational Complexity, by Fu Yuxi Polynomial Hierarchy 1 / 44 Larry Stockmeyer and Albert Meyer introduced

584 views • 45 slides

More recommend