scientific article
From MaRDI portal
Publication:3413301
zbMath1140.68402MaRDI QIDQ3413301
Publication date: 4 January 2007
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (13)
A derandomization using min-wise independent permutations ⋮ Deterministic Massively Parallel Connectivity ⋮ Pricing commodities ⋮ Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning ⋮ Unnamed Item ⋮ Scheduling split intervals with non-uniform demands ⋮ A note on the price of bandit feedback for mistake-bounded online learning ⋮ New bounds on the price of bandit feedback for mistake-bounded online multiclass learning ⋮ ON DISCRETE STOCHASTIC PROCESSES WITH DISJUNCTIVE OUTCOMES ⋮ Min-wise independent permutations ⋮ Unnamed Item ⋮ Protocols for asymmetric communication channels ⋮ Partially Independent Random Variables
This page was built for publication:
