adicionar à lista de desejos
Efficient Algorithms For Listing Combinatorial Structures
idioma: inglês
Editor:
CAMBRIDGE UNIVERSITY PRESS, julho de 2009 ‧
ver detalhes do produto
54,08€
10% DESCONTO
CARTÃO
VlZWMFVGQndZekkyYlhKRFowZzVNbm95YzJ0d1p6bFRNblZXVGtkQ09XRm9NbUZzYlV0RFQzZDZlVlpJWjFJeFozZGhkRmt2TWtaTGRtNVZOM2RSWTJOQ1VVa3pWRmRwYm5sNVIwbDJMelZ3YjJ4dmVFcHVObEp4ZDBGSVRtOXBiSEpqUW01T1NqSkRhRUpXTkZweVptUklNMUJJTTNaUFMzVk1Nbmh5WlZWT1N6bERLekowVVVoME5FeEpSVU5rTUdWVGJ6UkhTMmw1UTFKMFNVRkNVV3BJTDFnd0t6aExVbkZZZWt0UGRFMDRSbTh4YUdwU2FVaG9ja014UTNkWVNFVmhhMkZKVEdGT2EwUkZjV2RuSzI4dldXZGlhVVV2YW00MVdVNWFjWFpZTjFSclVsRmhSMnROYkZZMGRIbExlRGRQWlcxSU0xRTBZVEpVWVhKMmFIcEtaR2s1VWtkUWVHWktSRmMzTWxsQk1GZFdRWFoyS3l0blRsVjVSRm96Ym1Wc1IwNHhZMGw0TldRMmNtcDVZVlVyT1VZMU5XRlJUV1JxYVM5MFFsSXpPRko1VUdFeE5pc3ZVMWxEUldrd2FEUjRLeXR6U1hGaVpYcFRLMVFyYzIxemIwRjBaVE5KVW1OQ2VtWnZhR3A2UVhOU1YzUjVha3RTY2xWeWFUZFdaemxoUVd0M1dtaExNbWxIVjNoQ1YzbFZkbVJRUTFoSGVWSXpkRFo0UVRFeVpHRjZRU3RhUlUxSVdEazRRMnBtWWtkMmNqRkVLMWR4YlZSQ0wzUmlNRFJoTkVrNWFqTjBMMGxTUTNST1oyb3liM3BDUmxkblRESjZUakl2UVVkRWVFUkJLekpHWmpSaWJIbDFSMHhEYVUxTmMwdFRRV0ZNV1ZCSVVsVnJURXBVWTJNM2RtOWtTSEJEWldONWIyOWxSakIwZUhSM1RVSm5ZVVJVVHpCRFRqRm1NamhqU0RacGJsSk5WMU5WUWpCc1ExbGhhRWxEU2tKbGExZExSbE1yTTBWc1JqRk1lbFZTYkRRMVZVZERNSFppTUVadmEyWm9WRTQwYzNrMlJURnVkWEJwYVhjM1YzVlVNVTVzY1U1MVNWaENhV0UxTlhZMGNFRnpXa0p5VGxSUGJtWXdTMGRIY1VneVNrWnFlWFZWUVRsYVJtcEhTVk5uVDNoVFkyOTRTbVpVWTFaVVptOTVabmx3Um5oME5FUmhlakpsT0ZnclFUTk9UakpDTjNaeVRVTnZSQzlwVEdkdVNHMU9TMHRQVUhSS1VHbFpVR1ZIYmpOdmNVbGtUMFo0WXl0S1psbHdWR1UwUTI0NFIzWk1WalJSYTNKVU5GZEdXbkoyZUZoUlNrNUpWbkZCVEUxemR5OUlORnA2V2pCRmVXNTJkRzFYTVdJdlVsYzRNblZIZEVoblRISTFPVzVoY1VJMFRGaDJjMVJOUm1sWVJGSndZemRpVDJSTk5BPT06MWQvN0VHNDRKTGxkUld3LzExMktzdz09
portes grátis
Venda o seu livro
SINOPSE
First published in 1993, this thesis is concerned with the design of efficient algorithms for listing combinatorial structures. Some related work is also included which compares the listing problem with the difficulty of solving the existence problem, the construction problem, the random sampling problem, and the counting problem.
DETALHES
| Propriedade | Descrição |
|---|---|
| ISBN: | 9780521117883 |
| Editor: | CAMBRIDGE UNIVERSITY PRESS |
| Data de Lançamento: | julho de 2009 |
| Idioma: | Inglês |
| Encadernação: | Capa mole |
| Páginas: | 180 |
| Tipo de produto: | Livro |
| Coleção: | Distinguished Dissertations In Computer Science |
| Classificação Temática: |
Livros em Inglês
>
Ciências Exatas e Naturais
>
Matemática
|
| EAN: | 9780521117883 |
LIVROS DA MESMA COLEÇÃO
-
10%Specification And Proof In Real Time CspCAMBRIDGE UNIVERSITY PRESS74,35€ 10% CARTÃOportes grátis
-
10%Presumption And The Practices Of Tentative CognitionCAMBRIDGE UNIVERSITY PRESS56,78€ 10% CARTÃOportes grátis
-
10%Efficient Algorithms For Listing Combinatorial StructuresCAMBRIDGE UNIVERSITY PRESS156,82€ 10% CARTÃOportes grátis