Rainer Schuler - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 39 from 39

2021

2007

Randomized Algorithms for 3-SATThomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe. mst, 40(3):249-262, 2007. [doi]

2005

Randomized Quicksort and the Entropy of the Random SourceBeatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler. cocoon 2005: 450-460 [doi]

An algorithm for the satisfiability problem of formulas in conjunctive normal formRainer Schuler. jal, 54(1):40-44, 2005. [doi]

2004

Average-case intractability vs. worst-case intractabilityJohannes Köbler, Rainer Schuler. iandc, 190(1):1-17, 2004. [doi]

Randomized QuickSort and the Entropy of the Random SourceBeatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler. Dagstuhl 2005: [doi]

Randomized Quicksort and the Entropy of the Random Number GeneratorBeatrice List, Markus Maucher, Uwe Schöning, Rainer Schuler. eccc, (059), 2004. [doi]

2003

2002

The Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional ProblemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. mst, 35(4):449-463, 2002. [doi]

A Probabilistic 3-SAT Algorithm Further ImprovedThomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe. STACS 2002: 192-202 [doi]

Implementation of a Random Walk Method for Solving 3-SAT on Circular DNA MoleculesHubert Hug, Rainer Schuler. dna 2003: 133-142 [doi]

2001

On the Difference between Polynomial-Time Many-One and Truth-Table Reducibilities on Distributional ProblemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. STACS 2001: 51-62 [doi]

DNA-based Parallel Computation of Simple ArithmeticHubert Hug, Rainer Schuler. dna 2002: 321-328 [doi]

Strategies for the development of a peptide computerHubert Hug, Rainer Schuler. bioinformatics, 17(4):364-368, 2001.

2000

On the difference between polynomial-time many-one and truth-table reducibilities on distributional problemsShin Aida, Rainer Schuler, Tatsuie Tsukiji, Osamu Watanabe. eccc, 7(81), 2000. [doi]

Resource-Bounded Measure and LearnabilityWolfgang Lindner, Rainer Schuler, Osamu Watanabe. mst, 33(2):151-170, 2000. [doi]

1999

The Complexity of Generating Test InstancesChristoph Karg, Johannes Köbler, Rainer Schuler. cjtcs, 1999, 1999. [doi]

Universal Distributions and Time-Bounded Kolmogorov ComplexityRainer Schuler. STACS 1999: 434-443 [doi]

1998

Average-Case Intractability vs. Worst-Case IntractabilityJohannes Köbler, Rainer Schuler. mfcs 1998: 493-502 [doi]

Resource Bounded Measure and LearnabilityWolfgang Lindner, Rainer Schuler, Osamu Watanabe. cocoon 1998: 261 [doi]

1997

The Complexity of Generating Test InstancesChristoph Karg, Johannes Köbler, Rainer Schuler. STACS 1997: 375-386

A Note on Universal Distributions for Polynomial-Time Computable DistributionsRainer Schuler. cocoon 1997: 69-73 [doi]

1996

Truth-table Closure and Turing Closure of Average Polynomial Time have Different Measures in EXPRainer Schuler. cocoon 1996: 190-195 [doi]

Structural Average Case ComplexityRainer Schuler, Tomoyuki Yamakami. jcss, 52(2):308-348, 1996.

1995

1994

On Helping and Interactive Proof SystemsVikraman Arvind, Johannes Köbler, Rainer Schuler. isaac 1994: 137-145

1992

Structural Average Case ComplexityRainer Schuler, Tomoyuki Yamakami. fsttcs 1992: 128-139

1991

Random languages for nonuniform complexity classesMartin Mundhenk, Rainer Schuler. jc, 7(3):296-310, 1991. [doi]

Zufall als Ressource für KomplexitätsklassenRainer Schuler. PhD thesis, University of Ulm, Germany, 1991. [doi]

1990

Non-Uniform Complexity Classes and Random LanguagesMartin Mundhenk, Rainer Schuler. cocoon 1990: 110-119

Sign in or sign up to see more results.

runs on WebDSL