scientific article; zbMATH DE number 1304313
From MaRDI portal
Publication:4251043
zbMath0931.65048MaRDI QIDQ4251043
No author found.
Publication date: 17 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Numerical computation of determinants (65F40) Complexity and performance of numerical algorithms (65Y20)
Related Items (9)
Average-case intractability vs. worst-case intractability ⋮ Proofs of Work from worst-case assumptions ⋮ Worst-Case to Average-Case Reductions for Subclasses of P ⋮ Erasures versus errors in local decoding and property testing ⋮ Improved List-Decodability and List-Recoverability of Reed–Solomon Codes via Tree Packings ⋮ Singleton-type bounds for list-decoding and list-recovery, and related results ⋮ Computing the partition function of the Sherrington-Kirkpatrick model is hard on average ⋮ The Average-Case Complexity of Counting Cliques in Erdös--Rényi Hypergraphs ⋮ Pseudorandom generators without the XOR lemma
This page was built for publication:
