A Short Implicant of a CNF Formula with Many Satisfying Assignments (Q2942635): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W297482899 / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\Sigma_ 1^ 1\)-formulae on finite structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Pseudorandom Generators for Depth 2 Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast deterministic algorithm for formulas that have many satisfying assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the Lovász local lemma / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constructive proof of the general lovász local lemma / rank
 
Normal rank

Latest revision as of 17:48, 10 July 2024

scientific article
Language Label Description Also known as
English
A Short Implicant of a CNF Formula with Many Satisfying Assignments
scientific article

    Statements

    Identifiers