✦ LIBER ✦

Single-exception sorting networks and the computational complexity of optimal sorting network verification

✍ Scribed by Ian Parberry

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The VLSI optimality of the aks sorting n

✍ G. Bilardi; F.P. Preparata 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 342 KB

On the complexity of min–max sorting net

✍ Giuseppe Campobello; Giuseppe Patanè; Marco Russo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 741 KB

Bounds on the size of test sets for sort

✍ Moon Jung Chung; B. Ravikumar 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 613 KB

Tight Bounds on the Size of Fault-Tolera

✍ Leighton, Tom; Ma, Yuan 📂 Article 📅 1999 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 328 KB

An artificial neural network stimulating

✍ S Berdia; J.T Metz 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 458 KB

On the trade-off between single-neuron c

✍ Ramaswamy, Venkatakrishnan; Banerjee, Arunava 📂 Article 📅 2012 🏛 BioMed Central 🌐 English ⚖ 133 KB