Pages that link to "Item:Q4299296"
From MaRDI portal
The following pages link to Cryptographic limitations on learning Boolean formulae and finite automata (Q4299296):
Displayed 45 items.
- A time-series modeling method based on the boosting gradient-descent theory (Q412870) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Boosting algorithms: regularization, prediction and model fitting (Q449780) (← links)
- Classic learning (Q676240) (← links)
- Learning commutative deterministic finite state automata in polynomial time (Q749224) (← links)
- Theory revision with queries: Horn, read-once, and parity formulas (Q814598) (← links)
- The complexity of learning concept classes with polynomial general dimension (Q817832) (← links)
- Learning invariant features using inertial priors (Q870815) (← links)
- Optimally learning social networks with activations and suppressions (Q982645) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- A \(\mathbb R\)eal generalization of discrete AdaBoost (Q1028894) (← links)
- Partial Occam's Razor and its applications (Q1127393) (← links)
- Learning with unreliable boundary queries (Q1271553) (← links)
- On the approximability of minimizing nonzero variables or unsatisfied relations in linear systems (Q1274926) (← links)
- Synthesizers and their application to the parallel construction of pseudo-random functions (Q1288205) (← links)
- On the boosting ability of top-down decision tree learning algorithms (Q1305926) (← links)
- The query complexity of learning DFA (Q1336037) (← links)
- Toward efficient agnostic learning (Q1342730) (← links)
- The learnability of description logics with equality constraints (Q1342732) (← links)
- Simple learning algorithms using divide and conquer (Q1355381) (← links)
- Efficient learning of typical finite automata from random walks (Q1373138) (← links)
- On the difficulty of approximately maximizing agreements. (Q1401958) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- Structural results about exact learning with unspecified attribute values (Q1567399) (← links)
- Hardness results for neural network approximation problems (Q1603592) (← links)
- Arcing classifiers. (With discussion) (Q1807115) (← links)
- Some connections between learning and optimization (Q1885804) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Learning deterministic context free grammars: the Omphalos competition (Q2384127) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Efficient learning algorithms yield circuit lower bounds (Q2517822) (← links)
- On the influence of the variable ordering for algorithmic learning using OBDDs (Q2568437) (← links)
- Prediction-hardness of acyclic conjunctive queries (Q2581365) (← links)
- Minimizing nfa's and regular expressions (Q2641868) (← links)
- THEORETICAL FOUNDATIONS AND EXPERIMENTAL RESULTS FOR A HIERARCHICAL CLASSIFIER WITH OVERLAPPING CLUSTERS (Q2857293) (← links)
- Hybrid classification algorithms based on boosting and support vector machines (Q3639375) (← links)
- Structural analysis of polynomial-time query learnability (Q4298371) (← links)
- Exact Learning Algorithms, Betting Games, and Circuit Lower Bounds (Q5892607) (← links)
- Pac-learning non-recursive Prolog clauses (Q5917441) (← links)
- Computational sample complexity and attribute-efficient learning (Q5918064) (← links)
- Learning a circuit by injecting values (Q5920703) (← links)
- Boosting in the presence of noise (Q5921649) (← links)
- Cryptographic limitations on parallelizing membership and equivalence queries with applications to random-self-reductions (Q5958646) (← links)