✦ LIBER ✦

The Computational Complexity of Weak Saddles

✍ Scribed by Felix Brandt; Markus Brill; Felix Fischer; Jan Hoffmann

Book ID: 105915183
Publisher: Springer
Year: 2010
Tongue: English
Weight: 760 KB
Volume: 49
Category: Article
ISSN: 1433-0490
DOI: 10.1007/s00224-010-9298-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Mixed refinements of Shapley's saddles a

Mixed refinements of Shapley's saddles and weak tournaments

✍ John Duggan; Michel Le Breton 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 115 KB

The Computational Complexity of Sandpile

The Computational Complexity of Sandpiles

✍ Cristopher Moore; Martin Nilsson 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 235 KB

The Computational Complexity of Immanant

The Computational Complexity of Immanants

✍ Bürgisser, Peter 📂 Article 📅 2000 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 231 KB

Degrees of computational complexity

✍ H.B. Enderton 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 316 KB

We consider a measure ~b of computational complexity. The measure 9 determines a binary relation on the recursive functions; F is no harder to compute than G iff for every index g of G there is an index f off such that for nearly all x, the difficulty off at x (as measured by ~) is no more than the

Computational complexity of functions

✍ Leonid A. Levin 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 330 KB

The computational complexity of universa

The computational complexity of universal hashing

✍ Yishay Mansour; Noam Nisan; Prasoon Tiwari 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 891 KB