Rainer Schuler

Follow

Generating author description...

All published works

Action	Title	Year	Authors
+	A small span theorem within P	2010	Wolfgang Lindner Rainer Schuler
+ PDF Chat	The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems	2003	V. Arvind Rainer Schuler
+	The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems	2002	V. Arvind Rainer Schuler
+	Universal Distributions and Time-Bounded Kolmogorov Complexity	1999	Rainer Schuler
+	A note on universal distributions for polynomial-time computable distributions	1997	Rainer Schuler
+	Some properties of sets tractable under every polynomial-time computable distribution	1995	Rainer Schuler

Common Coauthors

Coauthor	Papers Together
V. Arvind	2
Wolfgang Lindner	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	Average case complexity under the universal distribution equals worst-case complexity	1992	Ming Li Paul Vitányi	3
+ PDF Chat	Strengths and Weaknesses of Quantum Computing	1997	Charles H. Bennett Ethan Bernstein Gilles Brassard Umesh Vazirani	2
+	Quantum Amplitude Amplification and Estimation	2000	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp	2
+	Quantum lower bound for the collision problem	2002	Scott Aaronson	2
+	The Complexity of Malign Measures	1993	Peter Bro Miltersen	2
+ PDF Chat	Quantum algorithms for element distinctness	2002	Harry Buhrman Christoph Dürr Mark Heiligman Peter Høyer Frédéric Magniez Miklós Sántha Ronald de Wolf	2
+ PDF Chat	Quantum lower bounds for the collision and the element distinctness problems	2003	Yaoyun Shi	2
+ PDF Chat	Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer	1997	Peter W. Shor	2
+ PDF Chat	An Introduction to Quantum Complexity Theory	2001	Richard Cleve	2
+	Computational complexity of real functions	1982	Ker‐I Ko Harvey M. Friedman	1
+	A note on universal distributions for polynomial-time computable distributions	1997	Rainer Schuler	1
+	Quantum amplitude amplification and estimation	2002	Gilles Brassard Peter Høyer Michele Mosca Alain Tapp	1
+	Some properties of sets tractable under every polynomial-time computable distribution	1995	Rainer Schuler	1
+	An Introduction to Kolmogorov Complexity and Its Applications	2019	Ming Li Paul Vitányi	1
+	On the greedy algorithm for satisfiability	1992	Ηλίας Κουτσουπιάς Christos H. Papadimitriou	1