Uwe Schöning

From MaRDI portal
Person:1052096

Available identifiers

zbMath Open schoning.uweMaRDI QIDQ1052096

List of research outcomes





PublicationDate of PublicationType
Graph isomorphism is low for PP2022-08-18Paper
Promise problems on probability distributions2020-07-20Paper
Reductions to sets of low information content (extended abstract)2019-12-04Paper
Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing2015-01-28Paper
Improving implementation of SLS solvers for SAT and new heuristics for \(k\)-SAT with long clauses2014-09-26Paper
Choosing probability distributions for stochastic local search and the role of make versus break2013-08-12Paper
Logic for computer scientists2011-02-10Paper
https://portal.mardi4nfdi.de/entity/Q30591942010-12-08Paper
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems2010-06-22Paper
Smaller superconcentrators of density 282010-01-18Paper
https://portal.mardi4nfdi.de/entity/Q36337412009-06-23Paper
Principles of Stochastic Local Search2009-02-17Paper
Theoretical computer science -- in brief2008-01-03Paper
Randomized algorithms for 3-SAT2007-03-12Paper
Computing and Combinatorics2006-01-11Paper
New Computational Paradigms2006-01-11Paper
STACS 20052005-12-02Paper
https://portal.mardi4nfdi.de/entity/Q47368392004-08-11Paper
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search.2003-01-21Paper
https://portal.mardi4nfdi.de/entity/Q47791372002-11-25Paper
https://portal.mardi4nfdi.de/entity/Q45483382002-08-26Paper
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart2002-05-21Paper
https://portal.mardi4nfdi.de/entity/Q46992892002-01-06Paper
Algorithmics2001-11-19Paper
https://portal.mardi4nfdi.de/entity/Q27541472001-11-11Paper
Construction of expanders and superconcentrators using Kolmogorov complexity2001-01-29Paper
https://portal.mardi4nfdi.de/entity/Q42192911998-11-08Paper
Complexity of Presburger arithmetic with fixed quantifier dimension1997-10-19Paper
https://portal.mardi4nfdi.de/entity/Q43424951997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43424921997-06-22Paper
https://portal.mardi4nfdi.de/entity/Q43362701997-05-12Paper
If NP has polynomial-size circuits, then MA=AM1997-02-28Paper
https://portal.mardi4nfdi.de/entity/Q47182341996-12-01Paper
https://portal.mardi4nfdi.de/entity/Q48585721995-12-14Paper
https://portal.mardi4nfdi.de/entity/Q48577871995-12-07Paper
https://portal.mardi4nfdi.de/entity/Q48577861995-12-07Paper
Instance complexity1995-03-01Paper
https://portal.mardi4nfdi.de/entity/Q43024541994-09-13Paper
https://portal.mardi4nfdi.de/entity/Q42814911994-03-10Paper
On random reductions from sparse sets to tally sets1994-01-31Paper
https://portal.mardi4nfdi.de/entity/Q42739471993-12-08Paper
Graph isomorphism is low for PP1993-09-16Paper
https://portal.mardi4nfdi.de/entity/Q42019371993-09-06Paper
https://portal.mardi4nfdi.de/entity/Q40043551993-01-23Paper
https://portal.mardi4nfdi.de/entity/Q40043461993-01-23Paper
Logarithmic advice classes1992-09-27Paper
Turing machines with few accepting computations and low sets for PP1992-09-27Paper
Logic for computer scientists1992-09-18Paper
https://portal.mardi4nfdi.de/entity/Q39931261992-09-17Paper
Probabilistic complexity classes and lowness1989-01-01Paper
On counting and approximation1989-01-01Paper
Graph isomorphism is in the low hierarchy1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37937331988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38000161988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38221521988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37982411988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38117081988-01-01Paper
The difference and truth-table hierarchies for NP1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37582451987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37779831987-01-01Paper
The polynomial-time hierarchy and sparse oracles1986-01-01Paper
Complexity and structure1986-01-01Paper
Complete sets and closeness to complexity classes1986-01-01Paper
The density and complexity of polynomial cores for intractable sets1986-01-01Paper
Sparse Sets, Lowness and Highness1986-01-01Paper
Optimal Approximations and Polynomially Levelable Sets1986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37490451986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47274311986-01-01Paper
Robust algorithms: a different approach to oracles1985-01-01Paper
Bi-immune sets for complexity classes1985-01-01Paper
On Circuit-Size Complexity and the Low Hierarchy in NP1985-01-01Paper
On bounded query machines1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36946941985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36902211985-01-01Paper
Immunity, Relativizations, and Nondeterminism1984-01-01Paper
Minimal pairs for P1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32176051984-01-01Paper
On small generators1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32176061984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32197631984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37315871984-01-01Paper
A low and a high hierarchy within NP1983-01-01Paper
On the structure of \(\Delta_ 2\!^ p\)1983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36705631983-01-01Paper
A uniform approach to obtain diagonal sets in complexity classes1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36802781982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36632881981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39423981981-01-01Paper

Research outcomes over time

This page was built for person: Uwe Schöning