Search results

From MaRDI portal
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • 2015-11-20 Paper The Fractal Dimension of SAT Formulas 2014-09-26 Paper The Community Structure of SAT Formulas 2013-08-12 Paper...
    10 bytes (18 words) - 16:25, 6 October 2023
  • Fractal Dimension of SAT Formulas 2014-09-26 Paper Resolution procedures for multiple-valued optimization 2014-08-01 Paper SAT-based MaxSAT algorithms 2013-08-23...
    10 bytes (17 words) - 06:14, 7 October 2023
  • Fractal Dimension of SAT Formulas 2014-09-26 Paper Resolution procedures for multiple-valued optimization 2014-08-01 Paper SAT-based MaxSAT algorithms 2013-08-23...
    10 bytes (17 words) - 16:25, 6 October 2023
  • continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas 2008-01-08 Paper Approximation, Randomization and Combinatorial Optimization...
    10 bytes (18 words) - 09:10, 24 September 2023
  • reconstruction problem for hypergraphs 2023-08-03 Paper Properties of SAT formulas characterizing convex sets with given projections 2023-06-02 Paper Structure...
    10 bytes (18 words) - 23:43, 24 September 2023
  • Resolution for Max-SAT 2009-07-09 Paper Efficiently Calculating Evolutionary Tree Measures Using SAT 2009-07-07 Paper Solving (Weighted) Partial MaxSAT through Satisfiability...
    10 bytes (19 words) - 14:26, 11 December 2023
  • de/entity/Q5091218 2022-07-21 Paper Solving non-uniform planted and filtered random SAT formulas greedily 2022-03-22 Paper Greed is good for deterministic scale-free...
    10 bytes (16 words) - 18:13, 24 September 2023
  • de/entity/Q2857384 2013-11-01 Paper Note on strong refutation algorithms for random k-SAT formulas 2013-07-19 Paper Weak quasi-randomness for uniform hypergraphs 2012-03-07...
    10 bytes (17 words) - 02:35, 10 December 2023
  • the satisfiability threshold and clustering of solutions of random 3-SAT formulas 2008-11-18 Paper https://portal.mardi4nfdi.de/entity/Q4819594 2004-09-27...
    10 bytes (17 words) - 15:49, 6 October 2023
  • Learning Rate Based Branching Heuristic for SAT Solvers 2016-09-05 Paper SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers 2015-11-20 Paper...
    10 bytes (17 words) - 18:32, 13 December 2023
  • continuous–discontinuous second‐order transition in the satisfiability of random Horn‐SAT formulas 2008-01-08 Paper Approximation, Randomization and Combinatorial Optimization...
    10 bytes (18 words) - 15:23, 10 December 2023
  • Paper On Moderately Exponential Time for SAT 2010-09-29 Paper STACS 2004 2007-10-01 Paper MAX-SAT for Formulas with Constant Clause Density Can Be Solved...
    10 bytes (16 words) - 18:34, 9 December 2023
  • problems 2022-05-16 Paper Solving non-uniform planted and filtered random SAT formulas greedily 2022-03-22 Paper Lower bounds on the runtime of crossover-based...
    10 bytes (18 words) - 18:04, 6 October 2023
  • Linear-Size Boolean Formulas 2013-06-07 Paper On Moderately Exponential Time for SAT 2010-09-29 Paper STACS 2004 2007-10-01 Paper MAX-SAT for Formulas with Constant...
    10 bytes (16 words) - 19:42, 24 September 2023
  • random Horn‐SAT formulas 2008-01-08 Paper Counting connected graphs and hypergraphs via the probabilistic method 2008-01-08 Paper Random k‐SAT: Two Moments...
    10 bytes (17 words) - 15:26, 6 December 2023
  • SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers 2015-11-20 Paper Impact of Community Structure on SAT Solver Performance 2014-09-26 Paper...
    10 bytes (16 words) - 19:52, 6 October 2023
  • Publication Date of Publication Type SATGraf: Visualizing the Evolution of SAT Formula Structure in Solvers 2015-11-20 Paper...
    10 bytes (16 words) - 13:37, 28 January 2024
  • 3-graphs 2013-10-10 Paper Note on strong refutation algorithms for random k-SAT formulas 2013-07-19 Paper Tree-minimal graphs are almost regular 2013-07-12 Paper...
    10 bytes (18 words) - 02:39, 7 October 2023
  • Fast, flexible MUS enumeration 2016-04-20 Paper SAT-Based Formula Simplification 2015-11-20 Paper SAT-Based Horn Least Upper Bounds 2015-11-20 Paper On...
    10 bytes (16 words) - 02:15, 10 December 2023
  • with respect to a given exact polyomino 2023-06-02 Paper Properties of SAT formulas characterizing convex sets with given projections 2023-06-02 Paper Structure...
    10 bytes (16 words) - 17:10, 8 December 2023
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)