Vote for your favorite mineral in #MinCup25! - Pectolite vs. HaĂĽyne
It's a pair of striking blue beauties as #pectolite the uncrushable faces off against #hauyne, the phoenix from volcanic ashes!
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Bernstein, Ethan, Vazirani, Umesh (1997) Quantum Complexity Theory. SIAM Journal on Computing, 26 (5). 1411-1473 doi:10.1137/s0097539796300921

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleQuantum Complexity Theory
JournalSIAM Journal on Computing
AuthorsBernstein, EthanAuthor
Vazirani, UmeshAuthor
Year1997 (October)Volume26
Issue5
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539796300921Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240106Long-form Identifiermindat:1:5:11240106:5
GUID0
Full ReferenceBernstein, Ethan, Vazirani, Umesh (1997) Quantum Complexity Theory. SIAM Journal on Computing, 26 (5). 1411-1473 doi:10.1137/s0097539796300921
Plain TextBernstein, Ethan, Vazirani, Umesh (1997) Quantum Complexity Theory. SIAM Journal on Computing, 26 (5). 1411-1473 doi:10.1137/s0097539796300921
In(1997, October) SIAM Journal on Computing Vol. 26 (5) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Bennett, Charles H., Bernstein, Ethan, Brassard, Gilles, Vazirani, Umesh (1997) Strengths and Weaknesses of Quantum Computing. SIAM Journal on Computing, 26 (5). 1510-1523 doi:10.1137/s0097539796300933
Vazirani, Umesh (1997) Introduction to Special Section on Quantum Computation. SIAM Journal on Computing, 26 (5). 1409-1410 doi:10.1137/smjcat000026000005001409000001
Ambainis, Andris, Schulman, Leonard J., Ta-Shma, Amnon, Vazirani, Umesh, Wigderson, Avi (2003) The Quantum Communication Complexity of Sampling. SIAM Journal on Computing, 32 (6). 1570-1585 doi:10.1137/s009753979935476
Vazirani, Umesh V., Vazirani, Vijay V. (1989) The Two-Processor Scheduling Problem is in Random NC. SIAM Journal on Computing, 18 (6). 1140-1148 doi:10.1137/0218076
Khanna, Sanjeev, Motwani, Rajeev, Sudan, Madhu, Vazirani, Umesh (1998) On Syntactic versus Computational Views of Approximability. SIAM Journal on Computing, 28 (1). 164-191 doi:10.1137/s0097539795286612
Simon, Daniel R. (1997) On the Power of Quantum Computation. SIAM Journal on Computing, 26 (5). 1474-1483 doi:10.1137/s0097539796298637
Vazirani, Vijay V., Yannakakis, Mihalis (2025) Computational Complexity of the Hylland–Zeckhauser Mechanism for One-Sided Matching Markets. SIAM Journal on Computing, 54 (2). doi:10.1137/23m157586x
Adleman, Leonard M., DeMarrais, Jonathan, Huang, Ming-Deh A. (1997) Quantum Computability. SIAM Journal on Computing, 26 (5). 1524-1540 doi:10.1137/s0097539795293639
Cole, Richard, Hariharan, Ramesh (1997) Tighter Upper Bounds on the Exact Complexity of String Matching. SIAM Journal on Computing, 26 (3). 803-856 doi:10.1137/s009753979324694x
Thomassen, Carsten (1997) On the Complexity of Finding a Minimum Cycle Cover of a Graph. SIAM Journal on Computing, 26 (3). 675-677 doi:10.1137/s0097539794267255
Pudlák, Pavel, Rödl, Vojtech, Sgall, Jirí (1997) Boolean Circuits, Tensor Ranks, and Communication Complexity. SIAM Journal on Computing, 26 (3). 605-633 doi:10.1137/s0097539794264809
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are © OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 17, 2025 08:54:56
Go to top of page