the class np isabel oitavem cmaf ul and fct unl recursion
play

The class NP Isabel Oitavem CMAF-UL and FCT-UNL - PowerPoint PPT Presentation

Dec 27, 2023 •47 likes •187 views

The class NP Isabel Oitavem CMAF-UL and FCT-UNL Recursion-theoretic approach Theorem FPtime [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace [ B ; SC , TR W ] (O 2008) P NP Pspace Recursion-theoretic approach Theorem FPtime

  1. The class NP Isabel Oitavem CMAF-UL and FCT-UNL

  2. Recursion-theoretic approach Theorem FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) P ⊆ NP ⊆ Pspace

  3. Recursion-theoretic approach Theorem FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) P ⊆ NP ⊆ Pspace FPtime ⊆ · · · ⊆ FPspace

  4. Recursion-theoretic approach Theorem FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) P ⊆ NP ⊆ Pspace FPtime ⊆ FPtime ∪ NP ⊆ FPspace

  5. Recursion-theoretic approach Theorem FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) P ⊆ NP ⊆ Pspace FPtime ⊆ FPtime ∪ NP ⊆ FPspace � �� � � �� � � �� � determ. non-determ. alternating � �� � � �� � � �� �

  6. Recursion-theoretic approach Theorem FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) P ⊆ NP ⊆ Pspace FPtime ⊆ FPtime ∪ NP ⊆ FPspace � �� � � �� � � �� � determ. non-determ. alternating � �� � � �� � � �� � recursion ? tree-recursion

  7. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) FPspace ≃ [ B ; SC , TR W ] (O 2008) ◮ f = SC( g , ¯ r , ¯ s ) f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) ◮ f = SR W ( g , h ) f ( ǫ, ¯ x ; ¯ y ) = g (¯ x ; ¯ y ) f ( z 0 , ¯ x ; ¯ y ) = h ( z 0 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) f ( z 1 , ¯ x ; ¯ y ) = h ( z 1 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) ◮ f = TR W ( g , h ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = h ( p , z 0 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = h ( p , z 1 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  8. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] (Bellantoni-Cook 1992) NP ≃ · · · FPspace ≃ [ B ; SC , TR W ] (O 2008) ◮ f = SC( g , ¯ s ) r , ¯ f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) ◮ f = SR W ( g , h ) f ( ǫ, ¯ x ; ¯ y ) = g (¯ x ; ¯ y ) f ( z 0 , ¯ x ; ¯ y ) = h ( z 0 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) f ( z 1 , ¯ x ; ¯ y ) = h ( z 1 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) ◮ f = TR W ( g , h ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = h ( p , z 0 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = h ( p , z 1 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  9. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] = ST 0 (Bellantoni-Cook 1992) NP ≃ [ ST 0 ; SC 0 , · · · ] FPspace ≃ [ B ; SC , TR W ] (O 2008) ◮ f = SC 0 ( g , ¯ s ) r , ¯ f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) , ¯ r , ¯ s ∈ ST 0 ◮ f = SR W ( g , h ) f ( ǫ, ¯ x ; ¯ y ) = g (¯ x ; ¯ y ) f ( z 0 , ¯ x ; ¯ y ) = h ( z 0 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) f ( z 1 , ¯ x ; ¯ y ) = h ( z 1 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) ◮ f = TR W ( g , h ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = h ( p , z 0 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = h ( p , z 1 , ¯ x ; ¯ y , f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  10. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] = ST 0 (Bellantoni-Cook 1992) NP ≃ [ ST 0 ; SC 0 , · · · ] FPspace ≃ [ B ; SC , TR W ] (O 2008) ◮ f = SC 0 ( g , ¯ s ) r , ¯ f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) , ¯ r , ¯ s ∈ ST 0 ◮ f = SR W ( g , h ) f ( ǫ, ¯ x ; ¯ y ) = g (¯ x ; ¯ y ) f ( z 0 , ¯ x ; ¯ y ) = h ( z 0 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) f ( z 1 , ¯ x ; ¯ y ) = h ( z 1 , ¯ x ; ¯ y , f ( z , ¯ x ; ¯ y )) ◮ f = TR W ( g , ∨ ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  11. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] = ST 0 (Bellantoni-Cook 1992) NP ≃ [ ST 0 ; SC 0 , ∨ -TR L W ] ◮ f = SC 0 ( g , ¯ r , ¯ s ) f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) , ¯ r , ¯ s ∈ ST 0 ◮ f = TR W ( g , ∨ ) = ∨ -TR L W ( g ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  12. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] = ST 0 (Bellantoni-Cook 1992) NP ≃ [ ST 0 ; SC 0 , ∨ -TR L W ] ◮ f = SC 0 ( g , ¯ r , ¯ s ) f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) , ¯ r , ¯ s ∈ ST 0 ◮ f = TR W ( g , ∨ ) = ∨ -TR L W ( g ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y ))

  13. Recursion-theoretic approach FPtime ≃ [ B ; SC , SR W ] = ST 0 (Bellantoni-Cook 1992) NP ≃ [ ST 0 ; SC 0 , ∨ -TR L W ] ≃ [ ST 0 ; SC 0 , ∨ -TR R W ] ◮ f = SC 0 ( g , ¯ s ) r , ¯ f (¯ x ; ¯ y ) = g (¯ r (¯ x ; );¯ s (¯ x ; ¯ y )) , ¯ r , ¯ s ∈ ST 0 ◮ f = TR W ( g , ∨ ) = ∨ -TR L W ( g ) f ( p , ǫ, ¯ x ; ¯ y ) = g ( p , ¯ x ; ¯ y ) f ( p , z 0 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) f ( p , z 1 , ¯ x ; ¯ y ) = ∨ ( ; f ( p 0 , z , ¯ x ; ¯ y ) , f ( p 1 , z , ¯ x ; ¯ y )) ◮ f = ∨ -TR R W ( g ) f ( ǫ, ¯ x ; ¯ y , p ) = g (¯ x ; ¯ y , p ) f ( z 0 , ¯ x ; ¯ y , p ) = ∨ ( ; f ( z , ¯ x ; ¯ y , p 0) , f ( z , ¯ x ; ¯ y , p 1)) f ( z 1 , ¯ x ; ¯ y , p ) = ∨ ( ; f ( z , ¯ x ; ¯ y , p 0) , f ( z , ¯ x ; ¯ y , p 1))

  14. Recursion-theoretic approach Theorem NP ≃ [ ST 0 ; SC 0 , ∨ -TR L W ] ≃ [ ST 0 ; SC 0 , ∨ -TR R W ] Lemma For all f ∈ [ ST 0 ; SC 0 , ∨ -TR L W ] there exists F ∈ [ ST 0 ; SC 0 , ∨ -TR R W ] such that ∀ ¯ x ∀ ¯ y f (¯ x ; ¯ y ) = F (¯ x , ¯ y ; ) .

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Numerical semigroups associated to algebraic curves A. Araujo 1 O. Neto 2 1 CMAF/UA 2 CMAF/FCUL

Numerical semigroups associated to algebraic curves A. Araujo 1 O. Neto 2 1 CMAF/UA 2 CMAF/FCUL

Numerical semigroups associated to algebraic curves A. Araujo 1 O. Neto 2 1 CMAF/UA 2 CMAF/FCUL Iberian Meeting on Numerical Semigroups, Porto 2008 2 Problems - 3 Objects 2 Problems - 3 Objects Classification of plane curves 2 Problems - 3

1.1k views • 78 slides
Multivariable Puiseux Theorem for Convergent Generalised Power Series Tamara Servi (CMAF Lisboa)

Multivariable Puiseux Theorem for Convergent Generalised Power Series Tamara Servi (CMAF Lisboa)

Multivariable Puiseux Theorem for Convergent Generalised Power Series Tamara Servi (CMAF Lisboa) Multivariable Puiseux Theorem for Convergent Generalised Power Series Tamara Servi (CMAF Lisboa) This talk is about solving equations in a class

1.53k views • 121 slides
Recursion New Syllabus 2019-20 Visit : python.mykvs.in for regular updates Recursion It is a

Recursion New Syllabus 2019-20 Visit : python.mykvs.in for regular updates Recursion It is a

Chapter 5 : Computer Science Class XII ( As per CBSE Board) Recursion New Syllabus 2019-20 Visit : python.mykvs.in for regular updates Recursion It is a way of programming or coding technique, in which a function calls itself for one or

503 views • 9 slides
Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for

Recursion in C++ Stephen P. Carl - CS 242 1 Recursion Defined Recursion is a technique for defining data structures or algorithms in terms of themselves . A recursive algorithm is a form of decomposition where rather than choosing an arbitrary

846 views • 22 slides
Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search

Topics Simple Recursion Chapter 13 Recursion with a Return Value Binary Search Revisited Recursion Recursion Versus Iteration Simple Recursion Recursive Methods When solving a problem using recursion, the idea is to

626 views • 13 slides
Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

279 views • 8 slides
Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that

Recursion Ch 14 Recursion There are two important parts of recursion: -A stopping case that ends the recursion -A reduction case that reduces the problem What are the base and stopping cases for the Fibonacci numbers? (sum of the previous

296 views • 11 slides
Recursion [3] In the last class Asymptotic growth rate The Sets , and

Recursion [3] In the last class Asymptotic growth rate The Sets , and

Algorithm : Design & Analysis Recursion [3] In the last class Asymptotic growth rate The Sets , and Complexity Class An Example: Maximum Subsequence Sum Improvement of Algorithm Comparison of Asymptotic

755 views • 34 slides
Latent class analysis with Stata Isabel Canette Principal Mathematician and Statistician

Latent class analysis with Stata Isabel Canette Principal Mathematician and Statistician

Latent class analysis with Stata Isabel Canette Principal Mathematician and Statistician StataCorp LLC 2018 Mexican Stata Users Group Meeting Tlaxcala, August 16-17, 2018 Introduction Latent class analysis (LCA) comprises a set of

512 views • 26 slides
CSSE 220 Recursion Checkout Recursion project from SVN Announcements Design problems part 3:

CSSE 220 Recursion Checkout Recursion project from SVN Announcements Design problems part 3:

CSSE 220 Recursion Checkout Recursion project from SVN Announcements Design problems part 3: due tomorrow at start of class. More Basketball: we added some requirements. Your code and design may need another round of edits this week!

368 views • 8 slides
Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion

Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion

Recursion Ch 14 Announcements Midterm graded on gradescope Highlights - recursion Recursion No fancy blue words or classes this chapter Recursion is simply calling a method from inside itself This copy will re-run the method on any new

363 views • 24 slides
Latent class analysis and finite mixture models with Stata Isabel Canette Principal

Latent class analysis and finite mixture models with Stata Isabel Canette Principal

Latent class analysis and finite mixture models with Stata Isabel Canette Principal Mathematician and Statistician StataCorp LLC 2017 Stata Users Group Meeting Madrid, October 19th, 2017 Introduction Latent class analysis (LCA)

658 views • 32 slides
Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Definition Recursion See "Recursion". Recursion If you still don't get it, see:

Advanced Programming Recursion Recursion Summary n Definition of recursion and divide et impera n Simple recursive algorithms n Merge Sort n Quicksort n More complex recursive algorithms 2 1 Advanced Programming Recursion

893 views • 60 slides
Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods

Chapter 17 Recursion Chapter Scope The concept of recursion Recursive methods Infinite recursion When to use (and not use) recursion Using recursion to solve problems Solving a maze Towers of Hanoi Java Foundations,

602 views • 41 slides
Recursion Recursion Recursion means to define something in terms of itself. In order to

Recursion Recursion Recursion means to define something in terms of itself. In order to

CS206 CS206 Recursion Recursion Recursion means to define something in terms of itself. In order to understand recursion, one must A directory is a collection of files and directories. first understand recursion. Anonymous

60 views • 4 slides
CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where

CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where

CSSE 220 Recursion Checkout Recursion project from SVN Recursion A solution technique where the same computation occurs repeatedly as the problem is solved recurs Examples: Sierpinski Triangle:

699 views • 7 slides
MFCS 2014 in Budapest , Hungary in 2014 39th International Symposium on Mathematical Foundations

MFCS 2014 in Budapest , Hungary in 2014 39th International Symposium on Mathematical Foundations

39th International Symposium on Mathematical Foundations of Computer Science (MFCS 2014) Invitation to the 39th International Symposium on Mathematical Foundations of Computer Science MFCS 2014 in Budapest , Hungary in 2014 39th International

299 views • 12 slides
P t Prr

P t Prr

P t Prr qs r Pr r rr t tr r Pr

159 views • 13 slides
Introduction to R Week 3: Selecting, ltering, and mutating Louisa Smith July 27 - July 31

Introduction to R Week 3: Selecting, ltering, and mutating Louisa Smith July 27 - July 31

Introduction to R Week 3: Selecting, ltering, and mutating Louisa Smith July 27 - July 31 Let's wrangle our data 2 / 43 Making variables in "Base R" nlsy$region_factor <- factor(nlsy$region) nlsy$income <-

713 views • 43 slides
19 May 2018, Suntec Singapore Important notice Forward-looking statements Certain statements in

19 May 2018, Suntec Singapore Important notice Forward-looking statements Certain statements in

Presentation by Frasers Centrepoint Trust at the REITs Symposium 2018 19 May 2018, Suntec Singapore Important notice Forward-looking statements Certain statements in this Presentation constitute forward - looking statements, including

294 views • 18 slides
Quality of Similarity Rankings in Time Series T. Bernecker, in Time Series M. E. Houle, H.-P.

Quality of Similarity Rankings in Time Series T. Bernecker, in Time Series M. E. Houle, H.-P.

Quality of Similarity Rankings Quality of Similarity Rankings in Time Series T. Bernecker, in Time Series M. E. Houle, H.-P. Kriegel, P. Krger, 12th International Symposium on Spatial and Temporal M. Renz, E. Schubert, Databases (SSTD

1.14k views • 18 slides
Three coupled wave guides and EP3s, a model Dieter Heiss, Stellenbosch Guenter Wunner, Suttgart

Three coupled wave guides and EP3s, a model Dieter Heiss, Stellenbosch Guenter Wunner, Suttgart

Three coupled wave guides and EP3s, a model Dieter Heiss, Stellenbosch Guenter Wunner, Suttgart Extension of studies of EP2s for two wave guides Challenge: four real parameters to be adjusted to obtain EP3 EP3s have richer structure: if the

338 views • 15 slides
T -maturity ZCB; time- t price denoted P ( t ; T ) . As a fct of T : Smooth. As a fct of t :

T -maturity ZCB; time- t price denoted P ( t ; T ) . As a fct of T : Smooth. As a fct of t :

T -maturity ZCB; time- t price denoted P ( t ; T ) . As a fct of T : Smooth. As a fct of t : Erratic (Ito-process). Continuously compounded ZC yield y ( t, ) is defined by P ( t ; t + ) = exp( y ( t ; )) y ( t ; ) = ln P (

269 views • 16 slides
tidyfun : Tidy Functional Data A new framework for working with functional data in R Fabian Scheipl

tidyfun : Tidy Functional Data A new framework for working with functional data in R Fabian Scheipl

tidyfun : Tidy Functional Data A new framework for working with functional data in R Fabian Scheipl 1 Jeff Goldsmith 2 1 : Dept. of Statistics, LMU Munich 2 : Columbia University Mailman School of Public Health Functional Data Painful to work with:

969 views • 61 slides

More recommend