Andreas Goerdt

Available identifiers

zbMath Open goerdt.andreasMaRDI QIDQ676450

List of research outcomes

Publication	Date of Publication	Type
A threshold for unsatisfiability	2022-08-18	Paper
Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions	2019-10-22	Paper
On Random Betweenness Constraints	2013-03-13	Paper
Satisfiability Thresholds beyond k −XORSAT	2012-09-10	Paper
Tight Thresholds for Cuckoo Hashing via XORSAT	2010-09-07	Paper
Fundamentals of Computation Theory	2010-04-20	Paper
On Random Betweenness Constraints	2009-10-20	Paper
On Random Ordering Constraints	2009-08-18	Paper
Recognizing more random unsatisfiable 3-SAT instances efficiently	2007-05-29	Paper
Strong Refutation Heuristics for Random k-SAT	2007-03-20	Paper
Recognizing More Unsatisfiable Random k-SAT Instances Efficiently	2006-06-01	Paper
Algorithms and Computation	2005-12-22	Paper
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques	2005-08-25	Paper
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT	2005-02-09	Paper
Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures	2004-06-18	Paper
Analysis of edge deletion processes on faulty random regular graphs.	2003-08-17	Paper
https://portal.mardi4nfdi.de/entity/Q4708577	2003-06-18	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/Q4535026	2002-06-12	Paper
https://portal.mardi4nfdi.de/entity/Q2762790	2002-01-09	Paper
https://portal.mardi4nfdi.de/entity/Q2754147	2001-11-11	Paper
The giant component threshold for random regular graphs with edge faults H. Prodinger	2001-08-20	Paper
Random regular graphs with edge faults: Expansion through cores	2001-08-20	Paper
https://portal.mardi4nfdi.de/entity/Q4508361	2001-06-21	Paper
https://portal.mardi4nfdi.de/entity/Q4525279	2001-01-22	Paper
A remark on random 2-SAT	2000-01-17	Paper
https://portal.mardi4nfdi.de/entity/Q4699304	1999-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q4268487	1999-10-28	Paper
Davis-Putnam resolution versus unrestricted resolution	1997-05-13	Paper
A threshold for unsatisfiability	1997-03-18	Paper
https://portal.mardi4nfdi.de/entity/Q4281687	1994-04-07	Paper
Regular Resolution Versus Unrestricted Resolution	1993-10-10	Paper
https://portal.mardi4nfdi.de/entity/Q4202937	1993-09-06	Paper
Characterizing complexity classes by general recursive definitions in higher types	1993-05-16	Paper
Characterizing complexity classes by higher type primitive recursive definitions	1992-09-27	Paper
Unrestricted resolution versus N-resolution	1992-06-28	Paper
https://portal.mardi4nfdi.de/entity/Q3979266	1992-06-26	Paper
https://portal.mardi4nfdi.de/entity/Q3358707	1990-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3203014	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3496329	1989-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3795189	1988-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3804171	1988-01-01	Paper
An automata-theoretical characterization of the OI-hierarchy	1986-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3745258	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3948612	1982-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Andreas Goerdt