A computer assisted optimal depth lower bound for sorting networks with nine inputs

1989 ◽  
Author(s):  
I. Parberry
Keyword(s):  
Lower Bound ◽  
Computer Assisted ◽  
Sorting Networks ◽  
Optimal Depth

A computer-assisted optimal depth lower bound for nine-input sorting networks

1991 ◽  
Vol 24 (1) ◽  
pp. 101-116 ◽  
Author(s):  
Ian Parberry
Keyword(s):  
Lower Bound ◽  
Computer Assisted ◽  
Sorting Networks ◽  
Optimal Depth

An Improved Lower Bound for Sorting Networks

1972 ◽  
Vol C-21 (6) ◽  
pp. 612-613 ◽  
Author(s):  
David C. Van Voorhis
Keyword(s):  
Lower Bound ◽  
Sorting Networks

Toward a Lower Bound for Sorting Networks

1972 ◽  
pp. 119-129 ◽  
Author(s):  
David C. Van Voorhis
Keyword(s):  
Lower Bound ◽  
Sorting Networks

scholarly journals Optimal-depth sorting networks

2017 ◽  
Vol 84 ◽  
pp. 185-204 ◽  
Author(s):  
Daniel Bundala ◽  
Michael Codish ◽  
Luís Cruz-Filipe ◽  
Peter Schneider-Kamp ◽  
Jakub Závodný
Keyword(s):  
Sorting Networks ◽  
Optimal Depth

A lower bound for sorting networks based on the shuffle permutation

1994 ◽  
Vol 27 (5) ◽  
pp. 491-508 ◽  
Author(s):  
C. G. Plaxton ◽  
T. Suel
Keyword(s):  
Lower Bound ◽  
Sorting Networks

A super-logarithmic lower bound for hypercubic sorting networks

1994 ◽  
pp. 618-629 ◽  
Author(s):  
C. Greg Plaxton ◽  
Torsten Suel
Keyword(s):  
Lower Bound ◽  
Sorting Networks

A Superlogarithmic Lower Bound for Shuffle-Unshuffle Sorting Networks

2000 ◽  
Vol 33 (3) ◽  
pp. 233-254
Author(s):  
C. G. Plaxton
Keyword(s):  
Lower Bound ◽  
Sorting Networks

Quantum accuracy threshold for concatenated distance-3 code

2006 ◽  
Vol 6 (2) ◽  
pp. 97-165 ◽  
Author(s):  
P. Aliferis ◽  
D. Gottesman ◽  
J. Preskill
Keyword(s):  
Lower Bound ◽  
Fault Tolerant ◽  
Combinatorial Analysis ◽  
Noise Model ◽  
Computer Assisted ◽  
Quantum Code ◽  
Stochastic Noise ◽  
Noise Models ◽  
New Criteria ◽  
Inductive Analysis

We prove a new version of the quantum threshold theorem that applies to concatenation of a quantum code that corrects only one error, and we use this theorem to derive a rigorous lower bound on the quantum accuracy threshold $\varepsilon_0$. Our proof also applies to concatenation of higher-distance codes, and to noise models that allow faults to be correlated in space and in time. The proof uses new criteria for assessing the accuracy of fault-tolerant circuits, which are particularly conducive to the inductive analysis of recursive simulations. Our lower bound on the threshold, $\varepsilon_0 \ge 2.73\times 10^{-5}$ for an adversarial independent stochastic noise model, is derived from a computer-assisted combinatorial analysis; it is the best lower bound that has been rigorously proven so far.

A Lower Bound on the Size of Shellsort Sorting Networks

1993 ◽  
Vol 22 (1) ◽  
pp. 62-71 ◽  
Author(s):  
Robert Cypher
Keyword(s):  
Lower Bound ◽  
Sorting Networks
Sign in / Sign up

Export Citation Format

Share Document