Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article; zbMATH DE number 1775429

From MaRDI portal
Publication:4542562
Jump to:navigation, search

zbMath1028.68214MaRDI QIDQ4542562

Salil P. Vadhan, Daniel R. Lewin

Publication date: 1 August 2002


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

Monte Carlo algorithm


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05)


Related Items

Approximation algorithms for MAX-3-CUT and other problems via complex semidefinite programming, Quantified Derandomization: How to Find Water in the Ocean, On the genericity of maximum rank distance and Gabidulin codes, A case of depth-3 identity testing, sparse factorization and duality, Unnamed Item, Unnamed Item, Black box polynomial identity testing of generalized depth-3 arithmetic circuits with bounded top fan-in, Recent Results on Polynomial Identity Testing, Algebraic Independence and Blackbox Identity Testing, Deterministically testing sparse polynomial identities of unbounded degree, Noisy interpolation of sparse polynomials in finite fields, Random construction of partial MDS codes, On hitting-set generators for polynomials that vanish rarely



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:4542562&oldid=18664803"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 7 February 2024, at 11:23.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki