scientific article; zbMATH DE number 5485587
From MaRDI portal
Publication:5302098
zbMath1231.68132MaRDI QIDQ5302098
Publication date: 5 January 2009
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (6)
An adaptivity hierarchy theorem for property testing ⋮ Block-symmetric polynomials correlate with parity better than symmetric ⋮ Unnamed Item ⋮ Pseudorandom generators, typically-correct derandomization, and circuit lower bounds ⋮ On Complete Problems, Relativizations and Logics for Complexity Classes ⋮ Efficient learning algorithms yield circuit lower bounds
This page was built for publication:
