scientific article; zbMATH DE number 1929945
From MaRDI portal
Publication:4708577
zbMATH Open1014.68227MaRDI QIDQ4708577FDOQ4708577
Authors: Tomasz Jurdziński, Andreas Goerdt 
Publication date: 18 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2420/24200280.htm
Title of this publication is not available (Why is that?)
Recommendations
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- An efficient approach to solving random \(k\)-SAT problems
- scientific article; zbMATH DE number 1002207
- Theory and Applications of Satisfiability Testing
- Kolmogorov complexity based upper bounds for the unsatisfiability threshold of random \(k\)-SAT
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- An exact and a randomized approach for the satisfiability problem
- scientific article; zbMATH DE number 1689045
- On the concentration of the number of solutions of random satisfiability formulas
Cited In (13)
- Title not available (Why is that?)
- An efficient approach to solving random \(k\)-SAT problems
- Geometric properties of satisfying assignments of random ε-1-in-kSAT
- On good algorithms for determining unsatisfiability of propositional formulas
- Title not available (Why is that?)
- Certifying unsatisfiability of random \(2k\)-SAT formulas using approximation techniques.
- The structure of the set of satisfying assignments for a random \(k\)-CNF
- Recognizing more random unsatisfiable 3-SAT instances efficiently
- Computing unsatisfiable \(k\)-SAT instances with few occurrences per variable
- Some Results on Random Unsatisfiable k-Sat Instances and Approximation Algorithms Applied to Random Structures
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- Recognizing More Unsatisfiable Random k-SAT Instances Efficiently
- Algorithms and Computation
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4708577)
