Pages that link to "Item:Q5261623"
From MaRDI portal
The following pages link to The Power of Negations in Cryptography (Q5261623):
Displaying 14 items.
- Negation-limited formulas (Q729897) (← links)
- Asymptotics of growth for non-monotone complexity of multi-valued logic function systems (Q1685402) (← links)
- The minimum number of negations in circuits for systems of multi-valued functions (Q1744290) (← links)
- Constructions for quantum indistinguishability obfuscation (Q2146070) (← links)
- Exact value of the nonmonotone complexity of Boolean functions (Q2313604) (← links)
- Lower bounds for Boolean circuits of bounded negation width (Q2672949) (← links)
- Circular security is complete for KDM security (Q2692344) (← links)
- On Negation Complexity of Injections, Surjections and Collision-Resistance in Cryptography (Q3179494) (← links)
- On the Complexity of Multivalued Logic Functions over Some Infinite Basis (Q4553643) (← links)
- (Q4638079) (← links)
- (Q5009536) (← links)
- Lower Bounds for DeMorgan Circuits of Bounded Negation Width (Q5090491) (← links)
- ON THE COMPLEXITY OF CIRCUITS IN BASES CONTAINING MONOTONE ELEMENTS WITH ZERO WEIGHTS (Q5150707) (← links)
- Flipping Out with Many Flips: Hardness of Testing $k$-Monotonicity (Q5243170) (← links)
