A characterization of approximation resistance for even k-partite CSPs
From MaRDI portal
Publication:2986869
DOI10.1145/2422436.2422459zbMath1361.68096arXiv1301.2731OpenAlexW2006271461MaRDI QIDQ2986869
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://arxiv.org/abs/1301.2731
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (2)
Complexity and approximability of parameterized MAX-CSPs ⋮ On the Approximability of Presidential Type Predicates
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
This page was built for publication: A characterization of approximation resistance for even k-partite CSPs