Pages that link to "Item:Q2674174"
From MaRDI portal
The following pages link to Generating hard satisfiability problems (Q2674174):
Displaying 39 items.
- Exact thresholds for DPLL on random XOR-SAT and NP-complete extensions of XOR-SAT (Q764375) (← links)
- A competitive and cooperative approach to propositional satisfiability (Q860390) (← links)
- Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
- Remote Agent: to boldly go where no AI system has gone before (Q1274747) (← links)
- Generalized satisfiability problems: Minimal elements and phase transitions. (Q1401338) (← links)
- How to fake an RSA signature by encoding modular root finding as a SAT problem (Q1408375) (← links)
- Experimental complexity analysis of continuous constraint satisfaction problems. (Q1425278) (← links)
- Backtracking algorithms for disjunctions of temporal constraints (Q1575430) (← links)
- Nagging: A scalable fault-tolerant paradigm for distributed search (Q1614863) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- On SAT instance classes and a method for reliable performance experiments with SAT solvers (Q1777389) (← links)
- A sharp threshold in proof complexity yields lower bounds for satisfiability search (Q1887710) (← links)
- An improved algorithm for the \((n, 3)\)-MaxSAT problem: asking branchings to satisfy the clauses (Q2051907) (← links)
- On the hierarchical community structure of practical Boolean formulas (Q2118321) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- A computational complexity analysis of tunable type inference for Generic Universe Types (Q2304565) (← links)
- Large hypertree width for sparse random hypergraphs (Q2343976) (← links)
- Implementing semantic merging operators using binary decision diagrams (Q2379333) (← links)
- Partition-based logical reasoning for first-order and propositional theories (Q2457688) (← links)
- Compiling problem specifications into SAT (Q2457689) (← links)
- A new constraint test-case generator and the importance of hybrid optimizers (Q2496069) (← links)
- On the complexity of unfrozen problems (Q2581544) (← links)
- Phase transitions of PP-complete satisfiability problems (Q2643309) (← links)
- Some pitfalls for experimenters with random SAT (Q2674180) (← links)
- A machine learning system to improve the performance of ASP solving based on encoding selection (Q2694597) (← links)
- Hierarchical Hardness Models for SAT (Q3523084) (← links)
- Complexity of Coloring Random Graphs (Q4577957) (← links)
- Fractional Edge Cover Number of Model RB (Q4632176) (← links)
- (Q5020571) (← links)
- Satisfiability in Boolean Logic (SAT problem) is polynomial? (Q5071401) (← links)
- Algorithms for Effective Argumentation in Classical Propositional Logic: A Connection Graph Approach (Q5445306) (← links)
- On Super Strong ETH (Q5856463) (← links)
- Generating Random SAT Instances: Multiple Solutions could be Predefined and Deeply Hidden (Q5881807) (← links)
- Random \( \Theta (\log n) \) -CNFs are Hard for Cutting Planes (Q5889793) (← links)
- Satisfiability threshold for power law random 2-SAT in configuration model (Q5896832) (← links)
- A sharp threshold for the phase transition of a restricted satisfiability problem for Horn clauses (Q5931554) (← links)
- Rigorous results for random (\(2+p)\)-SAT (Q5958803) (← links)
- Results related to threshold phenomena research in satisfiability: Lower bounds (Q5958805) (← links)
- How to split a logic program (Q6647305) (← links)
