scientific article; zbMATH DE number 6803218
From MaRDI portal
Publication:4589023
zbMath1373.68246MaRDI QIDQ4589023
Publication date: 6 November 2017
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
learninglower boundssatisfiabilitycircuit complexityderandomizationparameterized algorithmsexact algorithmsalgorithm analysis
Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (5)
Circuit lower bounds from learning-theoretic approaches ⋮ Quantified Derandomization: How to Find Water in the Ocean ⋮ Satisfiability Algorithms and Lower Bounds for Boolean Formulas over Finite Bases ⋮ Unnamed Item ⋮ Unnamed Item
This page was built for publication: