Rainer Schuler

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Sets computable in polynomial time on average
Lecture Notes in Computer Science
2023-12-12Paper
Structure in average case complexity2023-03-21Paper
The complexity of generating test instances
Lecture Notes in Computer Science
2022-11-09Paper
Measurement of the number of molecules of a single mRNA species in a complex mRNA preparation
Journal of Theoretical Biology
2020-05-06Paper
Switch-like behavior enables Wnt11 concentration specific response during dorso-ventral axis formation in \textit{Xenopus laevis}
Journal of Theoretical Biology
2018-03-09Paper
Average polynomial time is hard for exponential time under sn-reductions
Lecture Notes in Computer Science
2017-01-19Paper
Algorithms and Computation
Lecture Notes in Computer Science
2009-08-07Paper
Theory and Applications of Satisfiability Testing
Lecture Notes in Computer Science
2009-07-24Paper
scientific article; zbMATH DE number 5568413 (Why is no real title available?)2009-06-23Paper
Randomized algorithms for 3-SAT
Theory of Computing Systems
2007-03-12Paper
Randomized Quicksort and the entropy of the random source
Lecture Notes in Computer Science
2006-01-11Paper
Randomized Quicksort and the entropy of the random source
Lecture Notes in Computer Science
2006-01-11Paper
An algorithm for the satisfiability problem of formulas in conjunctive normal form
Journal of Algorithms
2005-02-22Paper
A probabilistic 3-SAT algorithm further improved
Lecture Notes in Computer Science
2004-08-11Paper
DNA-based parallel computation of simple arithmetic
Lecture Notes in Computer Science
2004-08-11Paper
Average-case intractability vs. worst-case intractability
Information and Computation
2004-08-06Paper
Implementation of a random walk method for solving 3-SAT on circular DNA molecules
Lecture Notes in Computer Science
2003-07-25Paper
The difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Theory of Computing Systems
2002-12-01Paper
scientific article; zbMATH DE number 1788736 (Why is no real title available?)2002-08-26Paper
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems
Lecture Notes in Computer Science
2002-01-09Paper
On helping and interactive proof systems
Lecture Notes in Computer Science
2001-01-24Paper
Resource-bounded measure and learnability
Theory of Computing Systems
2000-05-07Paper
scientific article; zbMATH DE number 1335899 (Why is no real title available?)1999-09-13Paper
scientific article; zbMATH DE number 1332677 (Why is no real title available?)1999-09-08Paper
Universal distributions and time-bounded Kolmogorov complexity
Lecture Notes in Computer Science
1999-06-17Paper
Average-case intractability vs. worst-case intractability
Lecture Notes in Computer Science
1998-11-11Paper
If NP has polynomial-size circuits, then MA=AM
Theoretical Computer Science
1997-02-28Paper
Some properties of sets tractable under every polynomial-time computable distribution
Information Processing Letters
1997-02-27Paper
Structural average case complexity
Journal of Computer and System Sciences
1997-01-27Paper
ON HELPING AND INTERACTIVE PROOF SYSTEMS
International Journal of Foundations of Computer Science
1995-10-29Paper
Random languages for nonuniform complexity classes
Journal of Complexity
1992-06-26Paper


Research outcomes over time


This page was built for person: Rainer Schuler