On the hierarchical community structure of practical Boolean formulas (Q2118321): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(7 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: CNFgen / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Graphplan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Saturn / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: Scikit / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: STP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3184756489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability, branch-width and Tseitin tautologies / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Fractal Dimension of SAT Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Community Structure of SAT Formulas / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short proofs are narrow—resolution made simple / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast unfolding of communities in large networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast planning through planning graph analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5227061 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random 3-SAT: The plot thickens / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of theorem-proving procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Satisfiability Testing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating SAT instances with community structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Expander graphs and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Rate Based Branching Heuristic for SAT Solvers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Determining computational complexity from characteristic ‘phase transitions’ / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hardness of SAT with Community Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of Community Structure on SAT Solver Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5148371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating hard satisfiability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272888 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Aided Verification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3624141 / rank
 
Normal rank

Latest revision as of 10:51, 28 July 2024

scientific article
Language Label Description Also known as
English
On the hierarchical community structure of practical Boolean formulas
scientific article

    Statements

    On the hierarchical community structure of practical Boolean formulas (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    22 March 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references