scientific article; zbMATH DE number 1962815
From MaRDI portal
Publication:4418651
zbMath1035.68052MaRDI QIDQ4418651
A. Pavan, Harry Buhrman, Lance J. Fortnow
Publication date: 11 August 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2607/26070212.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (3)
On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \) ⋮ Average-case intractability vs. worst-case intractability ⋮ Relations between average-case and worst-case complexity
This page was built for publication:
