Solving and sampling with many solutions: Satisfiability and other hard problems (Q5111870): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
label / enlabel / en
 
Solving and sampling with many solutions: Satisfiability and other hard problems
Property / DOI
 
Property / DOI: 10.4230/LIPIcs.IPEC.2017.11 / rank
Normal rank
 
Property / arXiv ID
 
Property / arXiv ID: 1708.01122 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving and sampling with many solutions: Satisfiability and other hard problems / 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 short proof for a theorem of Harper about Hamming-spheres / 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: A fast deterministic algorithm for formulas that have many satisfying assignments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4798347 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random generation of combinatorial structures from a uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short implicant of a CNF formula with many satisfying assignments / 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: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploiting independent subformulas: a faster approximation scheme for \(\# k\)-SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic algorithm for \(k\)-SAT based on limited local search and restart / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2745221522 / rank
 
Normal rank
Property / title
 
Solving and sampling with many solutions: Satisfiability and other hard problems (English)
Property / title: Solving and sampling with many solutions: Satisfiability and other hard problems (English) / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.4230/LIPICS.IPEC.2017.11 / rank
 
Normal rank

Latest revision as of 15:58, 30 December 2024

scientific article; zbMATH DE number 7205195
Language Label Description Also known as
English
Solving and sampling with many solutions: Satisfiability and other hard problems
scientific article; zbMATH DE number 7205195

    Statements

    0 references
    0 references
    0 references
    27 May 2020
    0 references
    satisfiability
    0 references
    sampling
    0 references
    parameterized complexity
    0 references
    Solving and sampling with many solutions: Satisfiability and other hard problems (English)
    0 references

    Identifiers

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