Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

84

Voted

MST
1998

61views more MST 1998»

Functions Computable with Nonadaptive Queries to NP

15 years 2 months ago

Functions Computable with Nonadaptive Queries to NP

Download www.uni-ulm.de

Harry Buhrman, Jim Kadin, Thomas Thierauf

Real-time Traffic

MST 1998 |

claim paper

Related Content

» On WorstCase to AverageCase Reductions for NP Problems

» Nonadaptive quantum query complexity

» Testing Juntas

» Composition Implies Adaptive Security in Minicrypt

» On Bounded Queries and Approximation

» Bounded Query Functions with Limited Output Bits

» From query complexity to computational complexity

» WorstCase to AverageCase Reductions Revisited

» Limitations of Hardness vs Randomness under Uniform Reductions

Post Info
More Details (n/a)

Added	22 Dec 2010
Updated	22 Dec 2010
Type	Journal
Year	1998
Where	MST
Authors	Harry Buhrman, Jim Kadin, Thomas Thierauf

Comments (0)