The following pages link to (Q4952609):
Displaying 30 items.
- Finding kernels or solving SAT (Q414435) (← links)
- Clique problem, cutting plane proofs and communication complexity (Q456115) (← links)
- The depth of resolution proofs (Q647405) (← links)
- Proof complexity of modal resolution (Q832717) (← links)
- Exponential lower bounds for the running time of DPLL algorithms on satisfiable formulas (Q862399) (← links)
- Improving resolution width lower bounds for \(k\)-CNFs with applications to the strong exponential time hypothesis (Q894453) (← links)
- A combinatorial characterization of treelike resolution space (Q1014444) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- Resolution lower bounds for perfect matching principles (Q1881260) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- Lower bound techniques for QBF expansion (Q1987510) (← links)
- Resolution with counting: dag-like lower bounds and different moduli (Q2029775) (← links)
- Reversible pebble games and the relation between tree-like and general resolution space (Q2033469) (← links)
- Resolution over linear equations modulo two (Q2334112) (← links)
- Strong ETH and resolution via games and the multiplicity of strategies (Q2408195) (← links)
- A game characterisation of tree-like Q-resolution size (Q2424676) (← links)
- A characterization of tree-like resolution size (Q2444907) (← links)
- Hard satisfiable instances for DPLL-type algorithms (Q2577593) (← links)
- A Game Characterisation of Tree-like Q-resolution Size (Q2799200) (← links)
- Time-Space Trade-offs in Resolution: Superpolynomial Lower Bounds for Superlinear Space (Q2817796) (← links)
- (Q3304106) (← links)
- (Q4625701) (← links)
- (Q4625702) (← links)
- (Q4993272) (← links)
- (Q5028438) (← links)
- MaxSAT Resolution and Subcube Sums (Q5875950) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- On (simple) decision tree rank (Q6050134) (← links)
- Space characterizations of complexity measures and size-space trade-offs in propositional proof systems (Q6168323) (← links)
- Advice complexity of adaptive priority algorithms (Q6180750) (← links)
