Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

19

APAL
2011

favoriteEmaildiscussreport

210views Software Engineering» more APAL 2011»

A sorting network in bounded arithmetic

13 years 7 hour ago

A sorting network in bounded arithmetic

Download www.math.cas.cz

We formalize the construction of Paterson’s variant of the Ajtai–Koml´os–Szemer´edi sorting network of logarithmic depth in the bounded arithmetical theory VNC1 ∗ (an extension of VNC1 ), under the assumption of existence of suitable expander graphs. We derive a conditional p-simulation of the propositional sequent calculus in the monotone sequent calculus MLK.

Emil Jerábek

Real-time Traffic

APAL 2011 | Monotone Sequent Calculus | Propositional Sequent Calculus | Sequent Calculus | Software Engineering |

claim paper

Related Content

» Lower Bounds on Correction Networks

» Hypercubic Sorting Networks

» Lower bounds for sorting networks

» Polynomial Vicinity Circuits and Nonlinear Lower Bounds

» Generalized Algorithm for Parallel Sorting on Product Networks

» Optimal Conclusive Sets for Comparator Networks

» Solving arithmetic problems using feedforward neural networks

» SortingBased Selection Algorithms for Hypercubic Networks

» Expressive Power of Unary Counters

Post Info
More Details (n/a)

Added	12 May 2011
Updated	12 May 2011
Type	Journal
Year	2011
Where	APAL
Authors	Emil Jerábek

Comments (0)