The following pages link to (Q4036700):
Displaying 21 items.
- Monotone measures of statistical complexity (Q341926) (← links)
- Complete problems for monotone NP (Q673092) (← links)
- Positive versions of polynomial time (Q1281503) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Complexity of monotonic functions (Q1820753) (← links)
- Monotone Boolean formulas can approximate monotone linear threshold functions (Q1878411) (← links)
- Proof complexity of monotone branching programs (Q2104254) (← links)
- Secret-sharing for NP (Q2397445) (← links)
- On the complexity of determinizing monitors (Q2399244) (← links)
- Acyclicity programming for sigma-protocols (Q2695643) (← links)
- Depth lower bounds for monotone semi-unbounded fan-in circuits. (Q2773024) (← links)
- Cutting-Edge Cryptography Through the Lens of Secret Sharing (Q2799105) (← links)
- Secret Sharing for mNP: Completeness Results (Q3179496) (← links)
- Distributed Pseudorandom Functions for General Access Structures in NP (Q3297480) (← links)
- Degrees of monotone complexity (Q3416117) (← links)
- A recursion-theoretic characterisation of the positive polynomial-time functions (Q5079742) (← links)
- Adventures in monotone complexity and TFNP (Q5090415) (← links)
- (Q5216300) (← links)
- Positive First-order Logic on Words and Graphs (Q6135776) (← links)
- The splitting power of branching programs of bounded repetition and CNFs of bounded width (Q6648277) (← links)
- CDS composition of multi-round protocols (Q6653053) (← links)