The following pages link to Massimo Lauria (Q930902):
Displaying 40 items.
- Minimum-energy broadcast and disk cover in grid wireless networks (Q930903) (← links)
- A note about \(k\)-DNF resolution (Q1641156) (← links)
- Algorithm analysis through proof complexity (Q1670749) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q1686838) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Cliques enumeration and tree-like resolution proofs (Q1708271) (← links)
- On semantic cutting planes with very small coefficients (Q1751424) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Circular (yet sound) proofs (Q2181918) (← links)
- Upper bounds on positional Paris-Harrington games (Q2222955) (← links)
- On the bounded-hop MST problem on random Euclidean instances (Q2382669) (← links)
- A characterization of tree-like resolution size (Q2444907) (← links)
- Verification and generation of unrefinable partitions (Q2681406) (← links)
- On the maximal part in unrefinable partitions of triangular numbers (Q2699707) (← links)
- Trade-offs Between Time and Memory in a Tighter Model of CDCL SAT Solvers (Q2818010) (← links)
- Space Complexity in Polynomial Calculus (Q2944568) (← links)
- Optimality of size-degree tradeoffs for polynomial calculus (Q2946621) (← links)
- Parameterized Bounded-Depth Frege Is not Optimal (Q2947567) (← links)
- From small space to small width in resolution (Q2965493) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- Minimum Energy Broadcast and Disk Cover in Grid Wireless Networks (Q3613654) (← links)
- Tight size-degree bounds for sums-of-squares proofs (Q4601842) (← links)
- Semantic Versus Syntactic Cutting Planes (Q4601887) (← links)
- A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (Q4973862) (← links)
- Clique Is Hard on Average for Regular Resolution (Q5056413) (← links)
- (Q5111132) (← links)
- Clique is hard on average for regular resolution (Q5230344) (← links)
- From Small Space to Small Width in Resolution (Q5277893) (← links)
- Narrow Proofs May Be Maximally Long (Q5277920) (← links)
- On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← links)
- A Rank Lower Bound for Cutting Planes Proofs of Ramsey’s Theorem (Q5326475) (← links)
- Towards an Understanding of Polynomial Calculus: New Separations and Lower Bounds (Q5326581) (← links)
- Structural Information and Communication Complexity (Q5710099) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- On the maximal part in unrefinable partitions of triangular numbers (Q6383621) (← links)
- Verification and generation of unrefinable partitions (Q6387091) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6584017) (← links)
