Found: 4
Select item for more details and to access through your institution.
Non-malleable Coding Against Bit-Wise and Split-State Tampering.
- Published in:
- Journal of Cryptology, 2017, v. 30, n. 1, p. 191, doi. 10.1007/s00145-015-9219-z
- By:
- Publication type:
- Article
Complexity of Approximating CSP with Balance / Hard Constraints.
- Published in:
- Theory of Computing Systems, 2016, v. 59, n. 1, p. 76, doi. 10.1007/s00224-015-9638-0
- By:
- Publication type:
- Article
The query complexity of estimating weighted averages.
- Published in:
- Acta Informatica, 2011, v. 48, n. 7/8, p. 417, doi. 10.1007/s00236-011-0145-8
- By:
- Publication type:
- Article
Is constraint satisfaction over two variables always easy?
- Published in:
- Random Structures & Algorithms, 2004, v. 25, n. 2, p. 150, doi. 10.1002/rsa.20026
- By:
- Publication type:
- Article