scientific article; zbMATH DE number 176869
From MaRDI portal
Publication:4036700
Recommendations
Cited in
(25)- Positive versions of polynomial time
- Cutting-edge cryptography through the lens of secret sharing
- Complexity of monotonic functions
- Monotone Boolean formulas can approximate monotone linear threshold functions
- Monotone separation of logarithmic space from logarithmic depth
- Proof complexity of monotone branching programs
- Secret-sharing for NP
- On the complexity of determinizing monitors
- Acyclicity programming for sigma-protocols
- Depth lower bounds for monotone semi-unbounded fan-in circuits.
- Cutting-edge cryptography through the lens of secret sharing
- Secret sharing for mNP: completeness results
- Distributed pseudorandom functions for general access structures in NP
- Degrees of monotone complexity
- Monotone measures of statistical complexity
- A recursion-theoretic characterisation of the positive polynomial-time functions
- Adventures in monotone complexity and TFNP
- Descriptive complexity for counting complexity classes
- Positive First-order Logic on Words and Graphs
- The splitting power of branching programs of bounded repetition and CNFs of bounded width
- CDS composition of multi-round protocols
- Complete problems for monotone NP
- Proof complexity of positive branching programs
- Taming adaptive security and new access structures in evolving secret sharing
- Prover-adversary games for systems over (non-deterministic) branching programs
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 Q4036700)
