ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
advertisementadvertisement
Information Processing Letters
Volume 54, Issue 1, 14 April 1995, Pages 41-43
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (260 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (1)
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0020-0190(94)00232-N    How to Cite or Link Using DOI (Opens New Window)
Copyright © 1995 Published by Elsevier Science B.V.

On helping by parity-like languages

Mitsunori Ogihara1

Department of Computer Science, University of Rochester, Rochester, NY 14627, USA

Received 1 September 1994; 
revised 2 November 1994. 
Communicated by D. Gries 
Available online 4 April 2000.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Author Keywords: Computational complexity

Article Outline

• References

Information Processing Letters
Volume 54, Issue 1, 14 April 1995, Pages 41-43
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.