logo
http://theoryofcomputing.org     ISSN 1557-2862
Endorsed by ACM SIGACT
  • Home
  • Introduction
  • Articles
  • Special Issues
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles by Amnon Ta-Shma
Volume 6, Article 3 (pages 47-79)
Quantum Expanders: Motivation and Construction
by Avraham Ben-Aroya, Oded Schwartz, and Amnon Ta-Shma
Volume 3, Article 3 (pages 45-60)
On the Hardness of Satisfiability with Bounded Occurrences in the Polynomial-Time Hierarchy
by Ishay Haviv, Oded Regev, and Amnon Ta-Shma