Angebote zu "Valiant" (5 Treffer)

Kategorien

Shops

The Brothers Jade , Hörbuch, Digital, 1, 418min
9,95 € *
ggf. zzgl. Versand

The world of Mythas is in transition. The old gods are near forgotten and a palpable tension hangs in the air. This is especially apparent to two young magic-casting brothers, Lawrence and Hesikiah, raised by a father who was a War Mage of the highest caliber and a mother whose shrewd diplomacy helped to forge the alliances of the five great nations to the West. Even with a lineage such as this, neither brother could have imagined the role they and the other valiant heroes soon to join them would play on the world stage. Or that their coming had been foretold in a series of ancient prophecies. Pro Se Productions presents The Brothers Jade, an exciting tale of fantasy and magic by author Don Thomas. Set on the landscape of his own imagination, Thomas creates a cast of characters that not only stand sword to shield with other fantasy creations, but also carry humanity in their every action. The Brothers Jade is as much a story of family and heroism and loyalty as it is of monsters, mages, and battle. Both a quest tale and a rousing adventures, The Brothers Jade brings out another aspect that is often overlooked in fantasy works. It is also a coming of age tale sat against the stark backdrop of intrigue and adventure, action and danger. A rousing adventure for any fan of Fantasy. The Brothers Jade by Don Thomas from Pro Se Productions, the leader in New Pulp and Genre Fiction. 1. Language: English. Narrator: Brian Held, Jr.. Audio sample: http://samples.audible.de/bk/acx0/083877/bk_acx0_083877_sample.mp3. Digital audiobook in aax.

Anbieter: Audible
Stand: 17.02.2020
Zum Angebot
Valiant Vazirani Theorem
34,00 € *
ggf. zzgl. Versand

High Quality Content by WIKIPEDIA articles! The Valiant Vazirani theorem is an important result in computational complexity theory. It was proven by Leslie Valiant and Vijay Vazirani in their paper titled "NP is as easy as detecting unique solutions" published in 1986. The theorem states that if there is a polynomial time algorithm for UNIQUE-SAT, then NP=RP. The theorem implies that even if the number of satisfying assignments is very small, SAT (which is an NP-complete problem) still remains a hard problem. UNIQUE-SAT is a promise problem that decides whether a given Boolean formula is unsatisfiable or has exactly one satisfying assignment. In the first case a UNIQUE-SAT algorithm would reject, and in the second it would accept the formula. If the formula has more than one satisfying assignment then the behavior of the UNIQUE-SAT algorithm does not matter.

Anbieter: Dodax
Stand: 17.02.2020
Zum Angebot
On the Power of Small-Depth Computation
135,00 CHF *
ggf. zzgl. Versand

The NP-completeness of SAT is a celebrated example of the power of bounded-depth computation: the core of the argument is a depth reduction establishing that any small nondeterministic circuit - an arbitrary NP computation on an arbitrary input - can be simulated by a small non deterministic circuit of depth 2 with unbounded fan-in - a SAT instance. Many other examples permeate theoretical computer science. On the Power of Small-Depth Computation discusses a selected subset of them, and includes a few unpublished proofs. On the Power of Small-Depth Computation starts with a unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over . It goes on to describe an unpublished proof that small bounded-depth circuits (AC°) have exponentially small correlation with the parity function. The proof is due to Adam Klivans and Salil Vadhan; it builds upon and simplifies previous ones. Thereafter, it looks at a depth-reduction result by Leslie Valiant, the proof of which has not before appeared in full. It concludes by presenting the result by Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz that shows that, under standard complexity theoretic assumptions, many cryptographic primitives can be implemented in very restricted computational models. On the Power of Small-Depth Computation is an ideal primer for anyone with an interest in computational complexity, random structures and algorithms and theoretical computer science generally.

Anbieter: Orell Fuessli CH
Stand: 17.02.2020
Zum Angebot
On the Power of Small-Depth Computation
76,99 € *
ggf. zzgl. Versand

The NP-completeness of SAT is a celebrated example of the power of bounded-depth computation: the core of the argument is a depth reduction establishing that any small nondeterministic circuit - an arbitrary NP computation on an arbitrary input - can be simulated by a small non deterministic circuit of depth 2 with unbounded fan-in - a SAT instance. Many other examples permeate theoretical computer science. On the Power of Small-Depth Computation discusses a selected subset of them, and includes a few unpublished proofs. On the Power of Small-Depth Computation starts with a unified treatment of the challenge of exhibiting explicit functions that have small correlation with low-degree polynomials over . It goes on to describe an unpublished proof that small bounded-depth circuits (AC°) have exponentially small correlation with the parity function. The proof is due to Adam Klivans and Salil Vadhan; it builds upon and simplifies previous ones. Thereafter, it looks at a depth-reduction result by Leslie Valiant, the proof of which has not before appeared in full. It concludes by presenting the result by Benny Applebaum, Yuval Ishai, and Eyal Kushilevitz that shows that, under standard complexity theoretic assumptions, many cryptographic primitives can be implemented in very restricted computational models. On the Power of Small-Depth Computation is an ideal primer for anyone with an interest in computational complexity, random structures and algorithms and theoretical computer science generally.

Anbieter: Thalia AT
Stand: 17.02.2020
Zum Angebot