#### Filter Results:

- Full text PDF available (30)

#### Publication Year

1981

2016

- This year (0)
- Last 5 years (10)
- Last 10 years (17)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Uwe Schöning
- FOCS
- 1999

We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch 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 a… (More)

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

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

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

- Johannes Köbler, Uwe Schöning, Klaus W. Wagner
- ITA
- 1987

- 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)

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

In [?], Schöning proposed a simple yet efficient randomized algorithm for solving the kSAT problem. In the case of 3-SAT, the algorithm has an expected running time of poly(n) · (4/3) = O(1.3334) 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 which… (More)

- 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)

- Pekka Orponen, Ker-I Ko, Uwe Schöning, Osamu Watanabe
- J. ACM
- 1994

We introduce a measure for the computational complexity of mdiwdual instances of a decision problem and study some of Its properties. The instance complexity of a string ~ with respect to a set A and time bound t, ict(x : A). is defined as the size of the smallest special-case program for A that run> m time t,decides x correctly, and makes no mistakes on… (More)

- José L. Balcázar, Uwe Schöning
- Mathematical systems theory
- 1985

An infinite and co-infinite setA is bi-immune for a complexity classC if neitherA nor its complement has an infinite subset inC. We prove various equivalent characterizations of this notion. Also, we introduce a stronger version of bi-immunity and show how both notions relate to density and other properties of sets in EXPTIME.