scientific article; zbMATH DE number 3990863
From MaRDI portal
Publication:3753481
zbMATH Open0612.68036MaRDI QIDQ3753481FDOQ3753481
Authors: Ravi B. Boppana, Jeffrey C. Lagarias 
Publication date: 1986
Title of this publication is not available (Why is that?)
Recommendations
complexity classesone-way functionssatisfiability problemconstant depth circuitsfinite functionspolynomial size circuitsunbounded fan-in circuits
Cited In (23)
- One-way functions and circuit complexity
- Generic Case Complexity and One-Way Functions
- On constructing 1-1 one-way functions
- A survey of one-way functions in complexity theory
- One-way permutations in NC 0
- A candidate counterexample to the easy cylinders conjecture
- On the circuit-size of inverses
- On intractability of the classUP
- On one-way functions and sparse languages
- Complexity bounds on general hard-core predicates.
- On basing size-verifiable one-way functions on NP-hardness
- Tight lower bounds on the ambiguity of strong, total, associative, one-way functions
- On negation complexity of injections, surjections and collision-resistance in cryptography
- On some natural complete operators
- Title not available (Why is that?)
- Functional inversion and communication complexity
- One-way permutations, computational asymmetry and distortion.
- Title not available (Why is that?)
- Semigroups and one-way functions
- Monotone circuits: one-way functions versus pseudorandom generators
- Inverse monoids associated with the complexity class NP
- Local restrictions from the Furst-Saxe-Sipser paper
- On characterizing the existence of partial one-way permutations
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3753481)
