Skip to main content
SpringerLink
Log in
Book cover

Parle ’91 Parallel Architectures and Languages Europe pp 252–269Cite as

On the Computational Complexity of Optimal Sorting Network Verification

  • Conference paper

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 505))

Abstract

A sorting network is a combinational circuit for sorting, constructed from comparison-swap units. The depth of such a circuit is a measure of its running time. It is reasonable to hypothesize that only the fastest (that is, the shallowest) networks are likely to be fabricated. It is shown that the problem of verifying that a given sorting network actually sorts is Co-NP complete even for sorting networks of depth only 4 [log n] + O(1) greater than optimal. This is shallower than previous depth bounds by a factor of two.

Research supported by NSF Grant CCR.8801659.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Ajtai, J. Komlós, and E. Szemerédi. An O(n. log n) sorting network. Proc. 15th Ann. ACM Symp. on Theory of Computing, pages 1–9, April 1983.

    Google Scholar 

  2. M. Ajtai, J. Komlós, and E. Szemerédi. Sorting in clog n parallel steps. Combinatorica, 3: 1–48, 1983.

    Article  MathSciNet  Google Scholar 

  3. K. E. Batcher. Sorting networks and their applications. In Proc. AFIPS Spring Joint Computer Conference, volume 32, pages 307–314, April 1968.

    Google Scholar 

  4. R. C. Bose and R. J. Nelson. A sorting problem. J. Assoc. Comput. Mach., 9: 282–296, 1962.

    Article  MathSciNet  Google Scholar 

  5. M. Chung and B. Ravikumar. On the size of test sets for sorting and related problems. In Proc. 1987 International Conference on Parallel Processing. Penn State Press, August 1987.

    Google Scholar 

  6. M. J. Chung and B. Ravikumar. Strong nondeterministic Turing reduction — a technique for proving intractability. J. Comput. System Sci., 39 (1): 2–20, 1989.

    Article  MathSciNet  Google Scholar 

  7. R. L. Drysdale. Sorting networks which generalize batcher’s odd-even merge. Honors Paper, Knox College, May 1973.

    Google Scholar 

  8. R. W. Floyd and D. E. Knuth. Improved constructions for the Bose-Nelson sorting problem (preliminary report). Notices of the AMS, 14: 283, 1967.

    Google Scholar 

  9. R. W. Floyd and D. E. Knuth. The Bose-Nelson sorting problem. In J. N. Srivastava, editor, A Survey of Combinatorial Theory. North-Holland, 1973.

    Chapter  Google Scholar 

  10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.

    Google Scholar 

  11. D. E. Knuth. Sorting and Searching, volume 3 of The Art of Computer Programming. Addison-Wesley, 1973.

    Google Scholar 

  12. I. Parberry. The alternating sorting network. Technical Report CS-87–26, Dept. of Computer Science, Penn. State Univ., September 1987.

    Google Scholar 

  13. I. Parberry. Parallel Complexity Theory. Research Notes in Theoretical Computer Science. Pitman Publishing, London, 1987.

    MATH  Google Scholar 

  14. I. Parberry. Sorting networks. Technical Report CS-88–08, Dept. of Computer Science, Penn. State Univ., March 1988.

    Google Scholar 

  15. I. Parberry. A computer-assisted optimal depth lower bound for sorting networks with nine inputs. In Proceedings of Supercomputing ‘89, pages 152–161, 1989.

    Google Scholar 

  16. I. Parberry. Single-exception sorting networks and the computational complexity of optimal sorting network verification. Mathematical Systems Theory, 23: 81–93, 1990.

    Article  MathSciNet  Google Scholar 

  17. M. S. Paterson. Improved sorting networks with O(log n) depth. Algorithmica, 5 (4): 75–92, 1990.

    Article  MathSciNet  Google Scholar 

  18. T. J. Schaefer. The complexity of satisfiability problems. In Proc. 10th Annual ACM Symposium on Theory of Computing, pages 216–226. Association for Computing Machinery, 1978.

    Google Scholar 

  19. D. C. Van Voorhis. An economical construction for sorting networks. In Proc. AFIPS National Computer Conference, volume 43, pages 921–926, 1974.

    Google Scholar 

  20. A. Yao. Bounds on selection networks. SIAM Journal on Computing, 9, 1980.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Author notes

  1. Ian Parberry

    Present address: Department of Computer Sciences, University of North Texas, P.O. Box 13886, Denton, TX., 76203-3886, USA

Authors and Affiliations

  1. Department of Computer Science, The Pennsylvania State University, USA

    Ian Parberry

Authors
  1. Ian Parberry
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Philips Research Laboratories, P.O. Box 80.000, 5600 JA, Eindhoven, The Netherlands

    Emile H. L. Aarts

  2. Department of Computer Science, University of Utrecht, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  3. Eindhoven University of Technology, P.O. Box 513, 5600 MB, Eindhoven, The Netherlands

    Martin Rem

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Parberry, I. (1991). On the Computational Complexity of Optimal Sorting Network Verification. In: Aarts, E.H.L., van Leeuwen, J., Rem, M. (eds) Parle ’91 Parallel Architectures and Languages Europe. Lecture Notes in Computer Science, vol 505. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-25209-3_18

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-25209-3_18

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-23206-4

  • Online ISBN: 978-3-662-25209-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation