Sipser-Lautemann Theorem: Computational Complexity Theory, Polynomial Hierarchy, Michael Sipser

Prices from
145.79

Featured

COMPARE ALL WEBSHOPS (2)

Description

Sipser-Lautemann Theorem: Computational Complexity Theory, Polynomial Hierarchy, Michael Sipser

Description Description
Product Specifications Product specifications
Related results Related results
Next
Previous

Compare webshops (2)

Sort by:

€ 145.79

€ 145.79

Description (0)

Sipser-Lautemann Theorem: Computational Complexity Theory, Polynomial Hierarchy, Michael Sipser

Product specifications

Brand OmniScriptum
EAN
  • 9786131192104

OmniScriptum

EXPTIME: EXPTIME, Computational Complexity theory, class, Decision problem, DTIME, P (complexity), NP...

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Pseudorandom Generator Theorem: Computational Complexity Theory, Cryptography,

€ 108.41
Compare 2 stores 2 stores

OmniScriptum

Pseudo-Polynomial Time: Computational Complexity Theory, Time Complexity, NP-Complete, NP-Hard

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Arthur-Merlin protocol: Computational Complexity theory, Interactive proof system, Random number generation, class,...

€ 108.41
Compare 2 stores 2 stores
Featured Choice
€ 145.79
To Shop