- 5 resultados
menor preço: € 37.07, preço mais alto: € 49.00, preço médio: € 43.52
1
Encomendar
no/na booklooker.de
€ 49.00
Envio: € 0.001
EncomendarLink patrocinado
Hardt, Moritz:

Testing Polynomial Identities with Fewer Random Bits - Can You Fool a Polynomial without Rolling Dice? - Livro de bolso

2008, ISBN: 9783639025422

[ED: Taschenbuch / Paperback], [PU: VDM Verlag Dr. Müller], Testing if a multivariate polynomial given as an arithmetic circuit is identically zero is a fundamental problem in the theory … mais…

  - Custos de envio:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00) Syndikat Buchdienst
2
Encomendar
no/na Dodax.de
€ 43.94
Envio: € 0.001
EncomendarLink patrocinado
Testing Polynomial Identities with Fewer Random Bits - nuovo livro

ISBN: 9783639025422

Testing if a multivariate polynomial given as an arithmetic circuit is identically zero is a fundamental problem in the theory of computation. It has been studied by computer scientists a… mais…

  - Nr. IV2RPBL3371. Custos de envio:Versandkosten: 0 EUR, 11, zzgl. Versandkosten. (EUR 0.00)
3
Testing Polynomial Identities with Fewer Random Bits - Hardt, Moritz
Encomendar
no/na amazon.co.uk
£ 31.99
(aproximadamente € 37.07)
Envio: € 5.561
EncomendarLink patrocinado
Hardt, Moritz:
Testing Polynomial Identities with Fewer Random Bits - Livro de bolso

2008

ISBN: 9783639025422

VDM Verlag Dr. Mueller e.K. Paperback, 52 Seiten, Publiziert: 2008-05-23T00:00:01Z, Produktgruppe: Book, 0.08 kg, Information Systems, Computer Science, Computing & Internet, Subjects, Bo… mais…

Custos de envio:Usually dispatched within 6 to 10 days. Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 5.56) Book Depository
4
Hardt, M: Testing Polynomial Identities with Fewer Random Bi - Hardt, Moritz
Encomendar
no/na amazon.de
€ 38.60
Envio: € 0.001
EncomendarLink patrocinado
Hardt, Moritz:
Hardt, M: Testing Polynomial Identities with Fewer Random Bi - Livro de bolso

2008, ISBN: 9783639025422

VDM Verlag, Taschenbuch, 52 Seiten, Publiziert: 2008-05-23T00:00:01Z, Produktgruppe: Buch, 0.18 kg, Verkaufsrang: 47960, Informatik, IT-Ausbildung & -Berufe, Computer & Internet, Kategori… mais…

Custos de envio:Derzeit nicht auf Lager. Bestellen Sie jetzt und wir liefern, sobald der Artikel verfügbar ist. Sie erhalten von uns eine E-Mail mit dem voraussichtlichen Lieferdatum, sobald uns diese Information vorliegt. Lieferung von Amazon. (EUR 0.00) Amazon.de
5
Testing Polynomial Identities with Fewer Random Bits Can You Fool a Polynomial without Rolling Dice? - Hardt, Moritz
Encomendar
no/na Achtung-Buecher.de
€ 49.00
Envio: € 0.001
EncomendarLink patrocinado
Hardt, Moritz:
Testing Polynomial Identities with Fewer Random Bits Can You Fool a Polynomial without Rolling Dice? - nuovo livro

2008, ISBN: 3639025423

Kartoniert / Broschiert, mit Schutzumschlag neu, [PU:VDM Verlag]

Custos de envio:Versandkostenfrei innerhalb der BRD. (EUR 0.00) MARZIES.de Buch- und Medienhandel, 14621 Schönwalde-Glien

1Como algumas plataformas não transmitem condições de envio e estas podem depender do país de entrega, do preço de compra, do peso e tamanho do item, de uma possível adesão à plataforma, de uma entrega direta pela plataforma ou através de um fornecedor terceirizado (Marketplace), etc., é possível que os custos de envio indicados pela terralivro não correspondam aos da plataforma ofertante.

Dados bibliográficos do melhor livro correspondente

Pormenores referentes ao livro
Hardt, M: Testing Polynomial Identities with Fewer Random Bi

Testing if a multivariate polynomial given as an arithmetic circuit is identically zero is a fundamental problem in the theory of computation. It has been studied by computer scientists and mathematicians for about thirty years. From early on, there have been efficient randomized algorithms solving the problem. However, designing efficient algorithms that use fewer or no random bits at all has turned into a notorious open problem over the years. By now, it is understood that a deterministic algorithm for general arithmetic circuits would have major consequences in theoretical computer science. To approach this goal, it is worthwhile to understand the randomness complexity of polynomial identity testing in restricted models. In this book, we consider some natural and well-studied models in which we obtain new results.

Dados detalhados do livro - Hardt, M: Testing Polynomial Identities with Fewer Random Bi


EAN (ISBN-13): 9783639025422
ISBN (ISBN-10): 3639025423
Livro de capa dura
Livro de bolso
Ano de publicação: 2008
Editor/Editora: VDM Verlag
52 Páginas
Peso: 0,094 kg
Língua: eng/Englisch

Livro na base de dados desde 2008-06-23T16:34:28-03:00 (Sao Paulo)
Página de detalhes modificada pela última vez em 2021-06-12T19:43:48-03:00 (Sao Paulo)
Número ISBN/EAN: 3639025423

Número ISBN - Ortografia alternativa:
3-639-02542-3, 978-3-639-02542-2
Ortografia alternativa e termos de pesquisa relacionados:
Autor do livro: hardt, moritz
Título do livro: without you, fool, rolling dice, vortragsbuch, polynomial identities, random


< Para arquivar...