Deutsch
Deutschland
Anmelden
Tipp von eurobuch.com
Ähnliche Bücher
Weitere, andere Bücher, die diesem Buch sehr ähnlich sein könnten:
Buch verkaufen
Anbieter, die das Buch mit der ISBN 9783639025422 ankaufen:
Suchtools
Buchtipps
Aktuelles
FILTER
- 0 Ergebnisse
Kleinster Preis: 38,65 €, größter Preis: 49,00 €, Mittelwert: 46,65 €
Testing Polynomial Identities with Fewer Random Bits - Can You Fool a Polynomial without Rolling Dice? - Hardt, Moritz
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Hardt, Moritz:
Testing Polynomial Identities with Fewer Random Bits - Can You Fool a Polynomial without Rolling Dice? - Taschenbuch

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 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., DE, [SC: 0.00], Neuware, gewerbliches Angebot, 22 cm, 52, [GW: 85g], Selbstabholung und Barzahlung, PayPal, offene Rechnung, Banküberweisung, Internationaler Versand

Neues Buch Booklooker.de
Syndikat Buchdienst
Versandkosten:Versandkostenfrei, Versand nach Deutschland. (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Testing Polynomial Identities with Fewer Random Bits - Can You Fool a Polynomial without Rolling Dice?
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Testing Polynomial Identities with Fewer Random Bits - Can You Fool a Polynomial without Rolling Dice? - Taschenbuch

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 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., [SC: 3.00], Neuware, gewerbliches Angebot, 22 cm, [GW: 85g]

Neues Buch Booklooker.de
Syndikat Buchdienst
Versandkosten:Versand nach Österreich (EUR 3.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Testing Polynomial Identities with Fewer Random Bits - Moritz Hardt
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Moritz Hardt:
Testing Polynomial Identities with Fewer Random Bits - neues Buch

ISBN: 9783639025422

ID: 412aadc1627d045ba397c7fff2a01ed0

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. Bücher / Naturwissenschaften, Medizin, Informatik & Technik / Mathematik, [PU: VDM Verlag Dr. Müller, Saarbrücken]

Neues Buch Dodax.ch
Nr. 57b2d8c0325362093ad93331 Versandkosten:Versandkosten: 0.0 EUR, Lieferzeit: 5 Tage, CH. (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Testing Polynomial Identities with Fewer Random Bits - Moritz Hardt
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Moritz Hardt:
Testing Polynomial Identities with Fewer Random Bits - Taschenbuch

ISBN: 9783639025422

Paperback, [PU: VDM Verlag Dr. Mueller e.K.], 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., Computer Science

Neues Buch Bookdepository.com
Versandkosten:Versandkostenfrei (EUR 0.00)
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.
Testing Polynomial Identities With Fewer Random Bits - Moritz Hardt
Vergriffenes Buch, derzeit bei uns nicht verfügbar.
(*)
Moritz Hardt:
Testing Polynomial Identities With Fewer Random Bits - Taschenbuch

ISBN: 9783639025422

ID: 9783639025422

Testing Polynomial Identities With Fewer Random Bits Testing-Polynomial-Identities-With-Fewer-Random-Bits~~Moritz-Hardt Technology Programming>Xxxsoftware Engr>* Desc Unknown Paperback, VDM Verlag Dr. Mueller e.K.

Neues Buch Barnesandnoble.com
new Versandkosten:zzgl. Versandkosten
Details...
(*) Derzeit vergriffen bedeutet, dass dieser Titel momentan auf keiner der angeschlossenen Plattform verfügbar ist.

Details zum Buch
Testing Polynomial Identities with Fewer Random Bits

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.

Detailangaben zum Buch - Testing Polynomial Identities with Fewer Random Bits


EAN (ISBN-13): 9783639025422
ISBN (ISBN-10): 3639025423
Gebundene Ausgabe
Taschenbuch
Erscheinungsjahr: 2008
Herausgeber: VDM Verlag
52 Seiten
Gewicht: 0,094 kg
Sprache: eng/Englisch

Buch in der Datenbank seit 23.06.2008 21:34:28
Buch zuletzt gefunden am 06.12.2017 21:08:17
ISBN/EAN: 9783639025422

ISBN - alternative Schreibweisen:
3-639-02542-3, 978-3-639-02542-2


< zum Archiv...
Benachbarte Bücher