Pages that link to "Item:Q1924380"

The following pages link to Oracles and queries that are sufficient for exact learning (Q1924380):

Displaying 38 items.

• Learning nearly monotone \(k\)-term DNF (Q293322) (← links)
• The unbiased black-box complexity of partition is polynomial (Q460634) (← links)
• Average-case intractability vs. worst-case intractability (Q598182) (← links)
• Derandomizing Arthur-Merlin games and approximate counting implies exponential-size lower bounds (Q645124) (← links)
• Arthur and Merlin as oracles (Q649095) (← links)
• The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
• Attribute-efficient learning of Boolean functions from Post closed classes (Q828191) (← links)
• \(\text{S}_{2}^{\text{P}} \subseteq \text{ZPP}^{\text{NP}}\) (Q859979) (← links)
• The 1-versus-2 queries problem revisited (Q970102) (← links)
• Parameterized learnability of juntas (Q1034613) (← links)
• A model of interactive teaching (Q1362340) (← links)
• Learning from examples with unspecified attribute values. (Q1401919) (← links)
• The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
• Exact learning via teaching assistants (Q1575459) (← links)
• Randomness vs time: Derandomization under a uniform assumption (Q1604214) (← links)
• A new abstract combinatorial dimension for exact learning via queries (Q1604216) (← links)
• Competing provers yield improved Karp-Lipton collapse results (Q1775885) (← links)
• Uniform characterizations of polynomial-query learnabilities (Q1870533) (← links)
• New lowness results for ZPP\(^{\text{NP}}\) and other complexity classes. (Q1872705) (← links)
• Two queries (Q1961371) (← links)
• Quantum learning of concentrated Boolean functions (Q2101535) (← links)
• Quantum algorithms for learning symmetric juntas via the adversary bound (Q2351390) (← links)
• Quantum algorithms for learning and testing juntas (Q2462663) (← links)
• Proving SAT does not have small circuits with an application to the two queries problem (Q2475408) (← links)
• Learning expressions and programs over monoids (Q2490112) (← links)
• Improved bounds on quantum learning algorithms (Q2491374) (← links)
• Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
• Circuit lower bounds from learning-theoretic approaches (Q2636410) (← links)
• $$P\mathop{ =}\limits^{?}NP$$ (Q2826803) (← links)
• On the Limit of Some Algorithmic Approach to Circuit Lower Bounds (Q2944904) (← links)
• Learning Grammars and Automata with Queries (Q2963594) (← links)
• Parameterized Learnability of k-Juntas and Related Problems (Q3520054) (← links)
• New collapse consequences of NP having small circuits (Q4645178) (← links)
• On Pseudodeterministic Approximation Algorithms. (Q5005164) (← links)
• (Q5028364) (← links)
• (Q5121895) (← links)
• The 1-Versus-2 Queries Problem Revisited (Q5387752) (← links)
• The power of natural properties as oracles (Q6116834) (← links)