Publication | Date of Publication | Type |
---|
Graph isomorphism is low for PP | 2022-08-18 | Paper |
Promise Problems on Probability Distributions | 2020-07-20 | Paper |
Reductions to sets of low information content | 2019-12-04 | Paper |
Search heuristics and the influence of non-perfect randomness: examining genetic algorithms and simulated annealing | 2015-01-28 | Paper |
Improving Implementation of SLS Solvers for SAT and New Heuristics for k-SAT with Long Clauses | 2014-09-26 | Paper |
Choosing Probability Distributions for Stochastic Local Search and the Role of Make versus Break | 2013-08-12 | Paper |
Logic for computer scientists | 2011-02-10 | Paper |
https://portal.mardi4nfdi.de/entity/Q3059194 | 2010-12-08 | Paper |
Comparing Two Stochastic Local Search Algorithms for Constraint Satisfaction Problems | 2010-06-22 | Paper |
Smaller superconcentrators of density 28 | 2010-01-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3633741 | 2009-06-23 | Paper |
Principles of Stochastic Local Search | 2009-02-17 | Paper |
https://portal.mardi4nfdi.de/entity/Q5434194 | 2008-01-03 | Paper |
Randomized algorithms for 3-SAT | 2007-03-12 | Paper |
Computing and Combinatorics | 2006-01-11 | Paper |
New Computational Paradigms | 2006-01-11 | Paper |
STACS 2005 | 2005-12-02 | Paper |
https://portal.mardi4nfdi.de/entity/Q4736839 | 2004-08-11 | Paper |
A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. | 2003-01-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4779137 | 2002-11-25 | Paper |
https://portal.mardi4nfdi.de/entity/Q4548338 | 2002-08-26 | Paper |
A probabilistic algorithm for \(k\)-SAT based on limited local search and restart | 2002-05-21 | Paper |
https://portal.mardi4nfdi.de/entity/Q4699289 | 2002-01-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q2756798 | 2001-11-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q2754147 | 2001-11-11 | Paper |
Construction of expanders and superconcentrators using Kolmogorov complexity | 2001-01-29 | Paper |
https://portal.mardi4nfdi.de/entity/Q4219291 | 1998-11-08 | Paper |
Complexity of Presburger arithmetic with fixed quantifier dimension | 1997-10-19 | Paper |
https://portal.mardi4nfdi.de/entity/Q4342492 | 1997-06-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4342495 | 1997-06-22 | Paper |
https://portal.mardi4nfdi.de/entity/Q4336270 | 1997-05-12 | Paper |
If NP has polynomial-size circuits, then MA=AM | 1997-02-28 | Paper |
https://portal.mardi4nfdi.de/entity/Q4718234 | 1996-12-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4858572 | 1995-12-14 | Paper |
https://portal.mardi4nfdi.de/entity/Q4857786 | 1995-12-07 | Paper |
https://portal.mardi4nfdi.de/entity/Q4857787 | 1995-12-07 | Paper |
Instance complexity | 1995-03-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4302454 | 1994-09-13 | Paper |
https://portal.mardi4nfdi.de/entity/Q4281491 | 1994-03-10 | Paper |
On random reductions from sparse sets to tally sets | 1994-01-31 | Paper |
https://portal.mardi4nfdi.de/entity/Q4273947 | 1993-12-08 | Paper |
Graph isomorphism is low for PP | 1993-09-16 | Paper |
https://portal.mardi4nfdi.de/entity/Q4201937 | 1993-09-06 | Paper |
https://portal.mardi4nfdi.de/entity/Q4004346 | 1993-01-23 | Paper |
https://portal.mardi4nfdi.de/entity/Q4004355 | 1993-01-23 | Paper |
Turing machines with few accepting computations and low sets for PP | 1992-09-27 | Paper |
Logarithmic advice classes | 1992-09-27 | Paper |
Logic for computer scientists | 1992-09-18 | Paper |
https://portal.mardi4nfdi.de/entity/Q3993126 | 1992-09-17 | Paper |
On counting and approximation | 1989-01-01 | Paper |
Probabilistic complexity classes and lowness | 1989-01-01 | Paper |
Graph isomorphism is in the low hierarchy | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3793733 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3798241 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3800016 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3811708 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3822152 | 1988-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3758245 | 1987-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3777983 | 1987-01-01 | Paper |
The difference and truth-table hierarchies for NP | 1987-01-01 | Paper |
Complexity and structure | 1986-01-01 | Paper |
The polynomial-time hierarchy and sparse oracles | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3749045 | 1986-01-01 | Paper |
The density and complexity of polynomial cores for intractable sets | 1986-01-01 | Paper |
Sparse Sets, Lowness and Highness | 1986-01-01 | Paper |
Optimal Approximations and Polynomially Levelable Sets | 1986-01-01 | Paper |
Complete sets and closeness to complexity classes | 1986-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q4727431 | 1986-01-01 | Paper |
Robust algorithms: a different approach to oracles | 1985-01-01 | Paper |
On bounded query machines | 1985-01-01 | Paper |
On Circuit-Size Complexity and the Low Hierarchy in NP | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3690221 | 1985-01-01 | Paper |
Bi-immune sets for complexity classes | 1985-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3694694 | 1985-01-01 | Paper |
Minimal pairs for P | 1984-01-01 | Paper |
On small generators | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3217605 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3217606 | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3219763 | 1984-01-01 | Paper |
Immunity, Relativizations, and Nondeterminism | 1984-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3731587 | 1984-01-01 | Paper |
On the structure of \(\Delta_ 2\!^ p\) | 1983-01-01 | Paper |
A low and a high hierarchy within NP | 1983-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3670563 | 1983-01-01 | Paper |
A uniform approach to obtain diagonal sets in complexity classes | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3680278 | 1982-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3663288 | 1981-01-01 | Paper |
https://portal.mardi4nfdi.de/entity/Q3942398 | 1981-01-01 | Paper |