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 50 items.
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- 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)
- Regular inference as vertex coloring (Q465248) (← links)
- Classic learning (Q676240) (← links)
- Learning commutative deterministic finite state automata in polynomial time (Q749224) (← links)
- Diameter and stationary distribution of random \(r\)-out digraphs (Q785578) (← 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)
- Weighted automata are compact and actively learnable (Q2032169) (← links)
- Learning infinite-word automata with loop-index queries (Q2124472) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- PCPs and the hardness of generating synthetic data (Q2210447) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- CORES: fusion of supervised and unsupervised training methods for a multi-class classification problem (Q2281972) (← links)
- The power of random counterexamples (Q2290678) (← links)
- Explaining AI decisions using efficient methods for learning sparse Boolean formulae (Q2331079) (← 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)
- Order-Revealing Encryption and the Hardness of Private Learning (Q2796125) (← links)
- Learning a Random DFA from Uniform Strings and State Information (Q2835622) (← links)
- Interactive Clustering of Linear Classes and Cryptographic Lower Bounds (Q2835625) (← links)