scientific article; zbMATH DE number 1738648
From MaRDI portal
Publication:4529982
zbMATH Open0984.68755MaRDI QIDQ4529982FDOQ4529982
Authors:
Publication date: 7 May 2002
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2054/20540199
Title of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 1746684
- An efficient approach to solving random \(k\)-SAT problems
- A Better Algorithm for Random k-SAT
- A better algorithm for random \(k\)-SAT
- Theory and Applications of Satisfiability Testing
- Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT
- A full derandomization of Schöning's \(k\)-\textsc{SAT} algorithm
- An exact and a randomized approach for the satisfiability problem
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
- scientific article; zbMATH DE number 1670827
Cited In (9)
- Complexity analysis of the SAT engine: DNA algorithms as probabilistic algorithms.
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- How efficiently can room at the bottom be traded away for speed at the top?
- Efficient 3-SAT algorithms in the tile assembly model
- Title not available (Why is that?)
- Theoretical Computer Science
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 Q4529982)
