Theoretical Computer Science

DOI10.1007/11560586zbMath1171.68482OpenAlexW2603408665MaRDI QIDQ5395078

Amitabh Saxena, Hemaspaandra, Lane A., Jörg Rothe

Publication date: 1 November 2006

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

Full work available at URL: https://doi.org/10.1007/11560586

zbMATH Keywords

computational complexityassociativitycommutativitystrong noninvertibilitycomplexity-theoretic one-way functions

Mathematics Subject Classification ID

Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (2)

Enforcing and defying associativity, commutativity, totality, and strong noninvertibility for worst-case one-way functions ⋮ If P \(\neq\) NP then some strongly noninvertible functions are invertible

This page was built for publication: Theoretical Computer Science