Derandomizing the HSSW algorithm for 3-SAT (Q378221): Difference between revisions

From MaRDI portal
Page on [mardi] deleted: Publication:378221
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
aliases / en / 0aliases / en / 0
 
Derandomizing HSSW Algorithm for 3-SAT
description / endescription / en
 
scientific article; zbMATH DE number 5939993
Property / title
 
Derandomizing HSSW Algorithm for 3-SAT (English)
Property / title: Derandomizing HSSW Algorithm for 3-SAT (English) / rank
 
Normal rank
Property / zbMATH Open document ID
 
Property / zbMATH Open document ID: 1353.68299 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/978-3-642-22685-4_1 / rank
 
Normal rank
Property / published in
 
Property / published in: Lecture Notes in Computer Science / rank
 
Normal rank
Property / publication date
 
17 August 2011
Timestamp+2011-08-17T00:00:00Z
Timezone+00:00
CalendarGregorian
Precision1 day
Before0
After0
Property / publication date: 17 August 2011 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 5939993 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1823899455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved deterministic local search algorithm for 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A deterministic \((2-2/(k+1))^{n}\) algorithm for \(k\)-SAT based on local search. / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-SAT Faster and Simpler - Unique-SAT Bounds for PPSZ Hold in General / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113688 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4736839 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Randomized Algorithms for 3-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501274 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving satisfiability in less than \(2^ n\) steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A full derandomization of schöning's k-SAT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Approximation Algorithms Based on Semidefinite Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3507036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Search and a Faster Deterministic Algorithm for 3-SAT / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 00:39, 7 July 2024

scientific article; zbMATH DE number 5939993
  • Derandomizing HSSW Algorithm for 3-SAT
Language Label Description Also known as
English
Derandomizing the HSSW algorithm for 3-SAT
scientific article; zbMATH DE number 5939993
  • Derandomizing HSSW Algorithm for 3-SAT

Statements

Derandomizing the HSSW algorithm for 3-SAT (English)
0 references
Derandomizing HSSW Algorithm for 3-SAT (English)
0 references
0 references
0 references
0 references
11 November 2013
0 references
17 August 2011
0 references
3-SAT
0 references
deterministic algorithm
0 references
derandomization
0 references

Identifiers

0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0 references