Spectral bounds on general hard core predicates. (Extended abstract)

DOI10.1007/3-540-46541-3_51MaRDI QIDQ4501567zbMATH OpenFDO

Authors Mikael Goldmann, Alexander Russell

Publication date 1 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-46541-3_51

zbMATH Keywords

Boolean functioncryptographic primitivescryptographyhard core predicateone-way function

Mathematics Subject Classification ID

Boolean functions (06E30) Cryptography (94A60)

Recommendations

• Complexity bounds on general hard-core predicates.
• The complexity of computing hard core predicates
• General hardness amplification of predicates and puzzles. (Extended abstract)
• scientific article; zbMATH DE number 4208066
• Hard-core theorems for complexity classes
• On the hardness of satisfiability with bounded occurrences in the polynomial-time hierarchy
• The Complexity of Somewhat Approximation Resistant Predicates
• Hard promise problems and nonuniform complexity
• scientific article; zbMATH DE number 18529
• Explicit optimal hardness via Gaussian stability results

Cited in

(4)

• The complexity of computing hard core predicates
• scientific article; zbMATH DE number 1962816 (Why is no real title available?)
• Hardness amplification within NP
• Complexity bounds on general hard-core predicates.

This page was built for publication: Spectral bounds on general hard core predicates. (Extended abstract)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4501567)