Many-one reduction: Computability theory, Computational complexity Reduction (complexity), Decision problem, Turing reduction, Emil Leon Post, Norman Shapiro

Prices from
127.10

Featured

COMPARE ALL WEBSHOPS (2)

Description

Many-one reduction: Computability theory, Computational complexity Reduction (complexity), Decision problem, Turing reduction, Emil Leon Post, Norman Shapiro

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

Compare webshops (2)

Shop
Price
Amazon Logo
€ 127.10
To Shop
Amazon Marketplace Logo
€ 127.10
To Shop
Description (0)

Many-one reduction: Computability theory, Computational complexity Reduction (complexity), Decision problem, Turing reduction, Emil Leon Post, Norman Shapiro

Product specifications

Brand OmniScriptum
EAN
  • 9786133782068

OmniScriptum

Reduction (Complexity): Computability Theory, Computational Complexity Class, Turing

€ 127.10
More Information More Info

OmniScriptum

First-Order Reduction: Computational Problem, Descriptive Complexity Theory, FO (complexity)

€ 127.10
Compare 2 stores 2 stores

OmniScriptum

Advice (complexity): Computational Complexity theory, Turing machine, Decision problem, class, Boolean circuit, Nondeterministic algorithm

€ 108.41
Compare 2 stores 2 stores

Alphascript Publishing

Decision Problem: Computability theory, Computational complexity Formal system, Function problem, Optimization Algorithm,...

€ 127.10
Compare 2 stores 2 stores
Featured Choice
€ 127.10
To Shop