29 search results - page 1 / 6 » A sorting network in bounded arithmetic |
APAL
2011
12 years 12 months ago
2011
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 ex...
ISAAC
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Correction networks are comparator networks that sort inputs differing from sorted sequences of length N in a small number of positions. The main application of such netw...
SIAMCOMP
1998
13 years 4 months ago
1998
Hypercubic sorting networks are a class of comparator networks whose structure maps e ciently to the hypercube and any of its bounded degree variants. Recently, n-input hypercubic...
STOC
1995
ACM
13 years 8 months ago
1995
ACM
COCO
1997
Springer
13 years 9 months ago
1997
Springer
We study families of Boolean circuits with the property that the number of gates at distance t fanning into or out of any given gate in a circuit is bounded above by a polynomial ...