The following pages link to Nicola Galesi (Q1405734):
Displayed 40 items.
- Optimality of size-width tradeoffs for resolution (Q1405735) (← links)
- Degree complexity for a modified pigeonhole principle (Q1407601) (← links)
- Item:Q1405734 (redirect page) (← links)
- A predicative and decidable characterization of the polynomial classes of languages (Q1589422) (← links)
- Cops-robber games and the resolution of Tseitin formulas (Q1656588) (← links)
- A lower bound for the pigeonhole principle in tree-like resolution by asymmetric prover-delayer games (Q1675824) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- On the complexity of resolution with bounded conjunctions (Q1885907) (← links)
- On the automatizability of polynomial calculus (Q1959382) (← links)
- Space proof complexity for random 3-CNFs (Q2013560) (← links)
- Bounded-depth Frege complexity of Tseitin formulas for all graphs (Q2084956) (← links)
- Tight bounds to localize failure nodes on trees, grids and through embeddings under Boolean network tomography (Q2136288) (← links)
- A characterization of tree-like resolution size (Q2444907) (← links)
- On the Relative Complexity of Resolution Refinements and Cutting Planes Proof Systems (Q2706120) (← links)
- (Q2754140) (← links)
- Monotone Proofs of the Pigeon Hole Principle (Q2765569) (← links)
- A Framework for Space Complexity in Algebraic Proof Systems (Q2796410) (← links)
- Total Space in Resolution (Q2829448) (← links)
- Proofs of Space: When Space Is of the Essence (Q2922680) (← links)
- Optimality of size-degree tradeoffs for polynomial calculus (Q2946621) (← links)
- Parameterized Bounded-Depth Frege Is not Optimal (Q2947567) (← links)
- Pseudo-partitions, transversality and locality (Q2986893) (← links)
- (Q3002766) (← links)
- Parameterized Bounded-Depth Frege Is Not Optimal (Q3012838) (← links)
- (Q4218927) (← links)
- A syntactic characterization of bounded-rank decision trees in terms of decision lists (Q4349779) (← links)
- Space complexity of random formulae in resolution (Q4417005) (← links)
- (Q4601841) (← links)
- (Q4737159) (← links)
- Cops-Robber Games and the Resolution of Tseitin Formulas (Q5053060) (← links)
- Resolution and the binary encoding of combinatorial principles (Q5091756) (← links)
- Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs (Q5092411) (← links)
- On the Proof Complexity of Paris-Harrington and Off-Diagonal Ramsey Tautologies (Q5278196) (← links)
- Theory and Applications of Satisfiability Testing (Q5713749) (← links)
- Theory and Applications of Satisfiability Testing (Q5714776) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892172) (← links)
- Parameterized Complexity of DPLL Search Procedures (Q5892559) (← links)
- Vertex-connectivity for node failure identification in Boolean network tomography (Q6121431) (← links)
- On vanishing sums of roots of unity in polynomial calculus and sum-of-squares (Q6184293) (← links)
- Space proof complexity for random $3$-CNFs via a $(2-\epsilon)$-Hall's Theorem (Q6256182) (← links)