Maximum Cut: Graph (mathematics), Cut (graph theory), Decision problem, Theoretical computer science, NP-complete, 2-satisfiability

Prijzen vanaf
35,17

Uitgelicht

VERGELIJK ALLE AANBIEDERS (2)

Beschrijving

Maximum Cut: Graph (mathematics), Cut (graph theory), Decision problem, Theoretical computer science, NP-complete, 2-satisfiability

Description Beschrijving
Product Specifications Productspecificaties
Gerelateerde resultaten Gerelateerde resultaten
Next
Previous

Vergelijk aanbieders (2)

Shop
Prijs
Verzendkosten
Totale prijs
Amazon Logo
35,17
Gratis
35,17
Naar shop
Gratis Shipping Costs
Amazon Marketplace Logo
35,17
Gratis
35,17
Naar shop
Gratis Shipping Costs
Beschrijving (0)

Maximum Cut: Graph (mathematics), Cut (graph theory), Decision problem, Theoretical computer science, NP-complete, 2-satisfiability

Productspecificaties

Merk OmniScriptum
EAN
  • 9786132745323

Series in Discrete Mathematics & Theoretical Computer Science Satisfiability Problem

196,71
Meer informatie Meer info

OmniScriptum

Maximum Common Subgraph Isomorphism Problem: Computational complexity theory, Optimization problem, NP-hard, Graph...

95,35
Vergelijk 2 shops 2 shops

OmniScriptum

Maximum satisfiability Problem: Computational complexity theory, Propositional formula, NP-hard, Boolean problem, NP-complete, APX

138,54
Vergelijk 2 shops 2 shops

OmniScriptum

Triangle Free Graph: Mathematics, Graph Theory, Neighbourhood (Graph Theory), Complete Bipartite

47,22
Vergelijk 2 shops 2 shops
Uitgelichte Keuze
35,17
Naar shop