Parity P: Computational Complexity Theory, Class

Name: Parity P: Computational Complexity Theory, Class
Brand: OmniScriptum
SKU: 4202cb851ec137f0752754103d7f9f0e

1/1

Prices from

127.10

Featured

Description

Parity P: Computational Complexity Theory, Class

Compare webshops (2)

Sort by:

€ 127.10

Description (0)

Parity P: Computational Complexity Theory, Class

Brand	OmniScriptum
EAN	9786133196421

OmniScriptum

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

OmniScriptum

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

OmniScriptum

NTIME: Computational Complexity Theory, Class, Non-Deterministic Turing Machine

OmniScriptum

complexity of Constraint Satisfaction: Computational theory, satisfaction, satisfaction problem, NP- complete, P (complexity), 2-satisfiability