A characterization of approximation resistance for even k-partite CSPs (Q2986869): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Learning from different teachers / rank
 
Normal rank
Property / cites work
 
Property / cites work: On specifying Boolean functions by labelled examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Measuring teachability using variants of the teaching dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Learning Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching Randomized Learners / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent Developments in Algorithmic Teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Occam's razor / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013552 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of inductive inference from good examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3272460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teaching a smarter learner. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of goal-oriented communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: In search of an easy witness: Exponential time vs. probabilistic polynomial time. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526985 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing polynomial identity tests means proving circuit lower bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4013545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A model of interactive teaching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudorandom generators for space-bounded computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the limits of efficient teachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Teachability in computational learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5396611 / rank
 
Normal rank

Latest revision as of 20:31, 13 July 2024

scientific article
Language Label Description Also known as
English
A characterization of approximation resistance for even k-partite CSPs
scientific article

    Statements

    A characterization of approximation resistance for even k-partite CSPs (English)
    0 references
    0 references
    0 references
    16 May 2017
    0 references
    0 references
    approximation resistance
    0 references
    unique games conjecture
    0 references
    0 references
    0 references