#### Filter Results:

- Full text PDF available (31)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (9)
- Last 10 years (19)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Uwe Schöning
- FOCS
- 1999

We present a simple probabilistic algorithm for solving k-SAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple local-search paradigm (cf. [9]): randomly guess an initial assignment and then, guided by those clauses (constraints) that are not satisfied, by successively choosing a random literal from such… (More)

- Evgeny Dantsin, Andreas Goerdt, +5 authors Uwe Schöning
- Theor. Comput. Sci.
- 2002

- Thomas Hofmeister, Uwe Schöning, Rainer Schuler, Osamu Watanabe
- STACS
- 2002

In [?], Schöning proposed a simple yet efficient randomized algorithm for solving the k-SAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) · (4/3) n = O(1.3334 n) when given a formula F on n variables. This was the up to now best running time known for an algorithm solving 3-SAT. In this paper, we describe an algorithm… (More)

- Uwe Schöning
- Algorithmica
- 2001

A simple probabilistic algorithm for solving the NP-complete problem k -SAT is reconsidered. This algorithm follows a well-known local-search paradigm: randomly guess an initial assignment and then, guided by those clauses that are not satisfied, by successively choosing a random literal from such a clause and changing the corresponding truth value, try to… (More)

- Uwe Schöning
- J. Comput. Syst. Sci.
- 1989

- Uwe Schöning
- J. Comput. Syst. Sci.
- 1987

- Ker-I Ko, Uwe Schöning
- SIAM J. Comput.
- 1985

- Johannes Köbler, Uwe Schöning, Jacobo Torán
- Acta Informatica
- 1988

We introduce a new class of functions, called span functions which count the different output values that occur at the leaves of the computation tree associated with a nondeterministic polynomial time Turing machine transducer. This function class has natural complete problems; it is placed between Valiant's function classes # P and # NP, and contains both… (More)

- José L. Balcázar, Ronald V. Book, Uwe Schöning
- SIAM J. Comput.
- 1986

- Adrian Balint, Uwe Schöning
- SAT
- 2012

Stochastic local search solvers for SAT made a large progress with the introduction of probability distributions like the ones used by the SAT Competition 2011 winners Sparrow2010 and EagleUp. These solvers though used a relatively complex decision heuristic, where probability distributions played a marginal role. In this paper we analyze a pure and simple… (More)