9781032762661 - graph coloring: from games to deterministic and quantum approaches di clerc, maurice (11 risultati)

- Brossura
Da: Majestic Books, Hounslow, Regno UnitoMajestic Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 74,41
EUR 7,58 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 3 disponibili
Condizione: New.

- Brossura
Da: California Books, Miami, FL, U.S.A.California Books
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 83,97
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

- Brossura
Da: PBShop.store US, Wood Dale, IL, U.S.A.PBShop.store US
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 85,87
Spedizione gratuitaSpedito in U.S.A.Quantità: Più di 20 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

- Brossura
Da: PBShop.store UK, Fairford, GLOS, Regno UnitoPBShop.store UK
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,95
EUR 4,85 spedizioneSpedito da Regno Unito a U.S.A.Quantità: Più di 20 disponibili
PAP. Condizione: New. New Book. Shipped from UK. Established seller since 2000.

- Brossura
Da: Biblios, frankfurt am main, HESSE, GermaniaBiblios
Contatta il venditoreVenditore con 4 stelleCondizione: Nuovo
EUR 87,86
EUR 9,95 spedizioneSpedito da Germania a U.S.A.Quantità: 3 disponibili
Condizione: New.

- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 100,70
EUR 11,67 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 2 disponibili
Paperback. Condizione: Brand New. 144 pages. 7.00x0.31x10.00 inches. In Stock.

- Brossura
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 78,80
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New.

- Brossura
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 105,00
EUR 61,34 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. Neuware - This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in…previous publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method.

- Brossura
- Print on Demand
Da: Grand Eagle Retail, Bensenville, IL, U.S.A.Grand Eagle Retail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 82,21
Spedizione gratuitaSpedito in U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in p…revious publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method. This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

- Brossura
- Print on Demand
Da: CitiRetail, Stevenage, Regno UnitoCitiRetail
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 88,92
EUR 43,17 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in p…revious publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method. This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

- Brossura
- Print on Demand
Da: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 215,51
EUR 31,75 spedizioneSpedito da Australia a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: new. Paperback. This book explores the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. Emphasis is placed on deterministic, guaranteed and non-guaranteed methods. Stochastic methods are then just mentioned because they are already widely described in p…revious publications.The study then details a general quantum algorithm of polynomial complexity. A final chapter provides elements of reflection on diplomatic algorithms that, for the problem of coloring under resource constraints, seek a compromise minimizing frustrations. The appendix includes some mathematical additions and the source codes of the main algorithms presented, in particular the one of the quantum method. This study is about the problem of minimal valid graph coloring, first in the form of games and then of resolution algorithms. This item is printed on demand. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.