| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe |
Randomized Algorithms for 3-SAT.  |
Theory Comput. Syst.  |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler |
An algorithm for the satisfiability problem of formulas in conjunctive normal form. |
J. Algorithms |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized Quicksort and the Entropy of the Random Source. |
COCOON |
2005 |
DBLP DOI BibTeX RDF |
Entropy, Randomized Algorithms, QuickSort |
| 1 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized Quicksort and the Entropy of the Random Number Generator |
Electronic Colloquium on Computational Complexity (ECCC) |
2004 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Rainer Schuler |
Average-case intractability vs. worst-case intractability. |
Inf. Comput. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Beatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler |
Randomized QuickSort and the Entropy of the Random Source. |
Algebraic Methods in Computational Complexity |
2004 |
DBLP BibTeX RDF |
|
| 1 | Sven Baumer, Rainer Schuler |
Improving a probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs |
Electronic Colloquium on Computational Complexity (ECCC) |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sven Baumer, Rainer Schuler |
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs. |
SAT |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Boris Hollas, Rainer Schuler |
A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods. |
WABI |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Rainer Schuler |
The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe |
The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. |
Theory Comput. Syst. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Hug, Rainer Schuler |
Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA Molecules. |
DNA |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe |
A Probabilistic 3-SAT Algorithm Further Improved. |
STACS |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Hug, Rainer Schuler |
Strategies for the development of a peptide computer. |
Bioinformatics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Hug, Rainer Schuler |
DNA-based Parallel Computation of Simple Arithmetic. |
DNA |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe |
On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional Problems. |
STACS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Shin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe |
On the difference between polynomial-time many-one and truth-table reducibilities on distributional problems |
Electronic Colloquium on Computational Complexity (ECCC) |
2000 |
DBLP BibTeX RDF |
|
| 1 | Wolfgang Lindner, Rainer Schuler, Osamu Watanabe |
Resource-Bounded Measure and Learnability. |
Theory Comput. Syst. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Karg, Johannes Köbler, Rainer Schuler |
The Complexity of Generating Test Instances. |
Chicago J. Theor. Comput. Sci. |
1999 |
DBLP BibTeX RDF |
|
| 1 | Rainer Schuler |
Universal Distributions and Time-Bounded Kolmogorov Complexity. |
STACS |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Johannes Köbler, Rainer Schuler |
Average-Case Intractability vs. Worst-Case Intractability |
Electronic Colloquium on Computational Complexity (ECCC) |
1998 |
DBLP BibTeX RDF |
|
| 1 | Johannes Köbler, Rainer Schuler |
Average-Case Intractability vs. Worst-Case Intractability. |
MFCS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Wolfgang Lindner, Rainer Schuler, Osamu Watanabe |
Resource Bounded Measure and Learnability. (PDF / PS) |
IEEE Conference on Computational Complexity |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Karg, Johannes Köbler, Rainer Schuler |
The Complexity of Generating Test Instances. |
STACS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler |
A Note on Universal Distributions for Polynomial-Time Computable Distributions. (PDF / PS) |
IEEE Conference on Computational Complexity |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler, Tomoyuki Yamakami |
Structural Average Case Complexity. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler |
Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXP. (PDF / PS) |
IEEE Conference on Computational Complexity |
1996 |
DBLP DOI BibTeX RDF |
computational complexity, completeness, average-case analysis, resource-bounded measure |
| 1 | Rainer Schuler |
Some Properties of Sets Tractable Under Every Polynomial-Time Computable Distribution. |
Inf. Process. Lett. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Uwe Schöning, Rainer Schuler |
If NP has Polynomial-Size Circuits, then MA=AM. |
Theor. Comput. Sci. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Rainer Schuler |
On Helping and Interactive Proof Systems. |
Int. J. Found. Comput. Sci. |
1995 |
DBLP BibTeX RDF |
|
| 1 | Rainer Schuler, Tomoyuki Yamakami |
Sets Computable in Polynomial Time on Average. |
COCOON |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Karg, Rainer Schuler |
Structure in Average Case Complexity. |
ISAAC |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler, Osamu Watanabe |
Towards Average-Case Complexity Analysis of NP Optimization Problems. |
Structure in Complexity Theory Conference |
1995 |
DBLP BibTeX RDF |
|
| 1 | Rainer Schuler |
Average Polynominal Time Is Hard for Exponential Time Under sn-Reductions. |
FSTTCS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Vikraman Arvind, Johannes Köbler, Rainer Schuler |
On Helping and Interactive Proof Systems. |
ISAAC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rainer Schuler, Tomoyuki Yamakami |
Structural Average Case Complexity. |
FSTTCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Rainer Schuler |
Random languages for nonuniform complexity classes. |
J. Complexity |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Martin Mundhenk, Rainer Schuler |
Non-Uniform Complexity Classes and Random Languages. |
Structure in Complexity Theory Conference |
1990 |
DBLP BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")