Pseudo-partitions, transversality and locality

DOI10.1145/2422436.2422486zbMath1364.03081OpenAlexW2114235518WikidataQ61732568 ScholiaQ61732568MaRDI QIDQ2986893

Nicola Galesi, Ilario Bonacina

Publication date: 16 May 2017

Published in: Proceedings of the 4th conference on Innovations in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2422436.2422486

zbMATH Keywords

resolutionpolynomial calculusproof complexityspace complexityrandom \(k\)-CNF formulae

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Applications of game theory (91A80) Mechanization of proofs and logical operations (03B35) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity of proofs (03F20)

Related Items

From Small Space to Small Width in Resolution, Space Complexity in Polynomial Calculus, On semantic cutting planes with very small coefficients, A Framework for Space Complexity in Algebraic Proof Systems

Uses Software

• PolyBoRi

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Teachability in computational learning
• Measuring teachability using variants of the teaching dimension
• Teaching a smarter learner.
• Occam's razor
• Pseudorandom generators for space-bounded computation
• On the power of inductive inference from good examples
• A model of interactive teaching
• Learning from different teachers
• On the limits of efficient teachability
• In search of an easy witness: Exponential time vs. probabilistic polynomial time.
• On the complexity of teaching
• On specifying Boolean functions by labelled examples
• Recent Developments in Algorithmic Teaching
• A theory of the learnable
• Teaching Randomized Learners
• Algorithmic Learning Theory
• A theory of goal-oriented communication
• Derandomizing polynomial identity tests means proving circuit lower bounds