Amanote Research
Register
Sign In
Discover open access scientific publications
Search, annotate, share and cite publications
Publications by Andreas Goerdt
Certifying Unsatisfiability of Random 2k-Sat Formulas Using Approximation Techniques
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Related publications
Approximating the Unsatisfiability Threshold of Random Formulas (Extended Abstract)
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Unsatisfiability Proofs for Parallel SAT Solver Portfolios With Clause Sharing and Inprocessing
Computation of Carson Formulas Using Piecewise Approximation of Kernel Function
International Journal for Engineering Modelling
Mechanics of Materials
Mechanical Engineering
Simulation
Computer Science Applications
Modeling
Software
Model Checking With SAT-Based Characterization of ACTL Formulas
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Fault Tolerance Analysis of Distributed Reconfigurable Systems Using SAT-Based Techniques
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Random Formulas Have Frozen Variables
SIAM Journal on Computing
Mathematics
Computer Science
SAT-based Techniques in System Synthesis
Notions of Average-Case Complexity for Random 3-Sat
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
