The following pages link to Andreas Goerdt (Q676450):
Displaying 46 items.
- (Q198218) (redirect page) (← links)
- A threshold for unsatisfiability (Q676451) (← links)
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT (Q706614) (← links)
- Unrestricted resolution versus N-resolution (Q1185013) (← links)
- Characterizing complexity classes by higher type primitive recursive definitions (Q1193623) (← links)
- Characterizing complexity classes by general recursive definitions in higher types (Q1207943) (← links)
- Davis-Putnam resolution versus unrestricted resolution (Q1353991) (← links)
- Analysis of edge deletion processes on faulty random regular graphs. (Q1401301) (← links)
- A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. (Q1853552) (← links)
- A remark on random 2-SAT (Q1961467) (← links)
- Matched instances of quantum satisfiability (QSat) -- product state solutions of restrictions (Q2330558) (← links)
- (Q2754147) (← links)
- (Q2762790) (← links)
- Satisfiability Thresholds beyond k −XORSAT (Q2907497) (← links)
- Regular Resolution Versus Unrestricted Resolution (Q3137703) (← links)
- On Random Betweenness Constraints (Q3183605) (← links)
- (Q3203014) (← links)
- (Q3358707) (← links)
- On Random Ordering Constraints (Q3392946) (← links)
- Strong Refutation Heuristics for Random k-SAT (Q3429738) (← links)
- Recognizing more random unsatisfiable 3-SAT instances efficiently (Q3439113) (← links)
- (Q3496329) (← links)
- Tight Thresholds for Cuckoo Hashing via XORSAT (Q3587381) (← links)
- (Q3745258) (← links)
- An automata-theoretical characterization of the OI-hierarchy (Q3765259) (← links)
- (Q3795189) (← links)
- (Q3804171) (← links)
- (Q3948612) (← links)
- (Q3979266) (← links)
- (Q4202937) (← links)
- (Q4268487) (← links)
- (Q4281687) (← links)
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures (Q4471151) (← links)
- (Q4508361) (← links)
- (Q4525279) (← links)
- (Q4535026) (← links)
- (Q4699304) (← links)
- (Q4708577) (← links)
- On Random Betweenness Constraints (Q4911112) (← links)
- A threshold for unsatisfiability (Q5096838) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313034) (← links)
- Recognizing More Unsatisfiable Random <i>k</i>-SAT Instances Efficiently (Q5470697) (← links)
- Algorithms and Computation (Q5712137) (← links)
- Fundamentals of Computation Theory (Q5900782) (← links)
- The giant component threshold for random regular graphs with edge faults H. Prodinger (Q5941282) (← links)
- Random regular graphs with edge faults: Expansion through cores (Q5941563) (← links)
