Toggle navigation
PDFSEARCH.IO
Document Search Engine - browse more than 18 million documents
Sign up
Sign in
Back to Results
First Page
Meta Content
View Document Preview and Link
On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University
Add to Reading List
Document Date: 2011-05-12 16:09:32
Open Document
File Size: 158,95 KB
Share Result on Facebook
City
University /
/
Company
Single Exception Sorting Networks /
Sorting Networks /
Computer Sciences /
/
/
Facility
University of North Texas /
/
IndustryTerm
min network /
given n-input comparator network /
n-input merging network /
insertion networks /
insertion network /
comparator network /
d-level comparator network /
n-input comparator network /
/
Organization
The Pennsylvania State University /
S. Therefore /
Bn \X /
Optimal Sorting Network Verification Ian Parberry∗ Department /
S. But /
National Science Foundation /
University of North Texas /
Bn /
Department of Computer Sciences /
/
Person
Ian Parberry /
Van Voorhis /
/
Position
Author /
Prime Minister /
/
Region
North Texas /
/
SocialTag
Comparator
Structure
Electronics
Bitonic sorter
Pairwise sorting network
Sorting algorithms
Sorting network
Mathematics
On the Computational Complexity of Optimal Sorting Network Verification Ian Parberry∗ Department of Computer Science The Pennsylvania State University