| Login |
Items where Person is "Ingólfsdóttir-A"
Jump to: 2008 Number of items: 2. 2008Buchfuhrer, David and Umans, Christopher (2008) The Complexity of Boolean Formula Minimization. In: Automata, Languages and Programming. Lecture Notes in Computer Science. No.5125. Springer , Berlin, pp. 24-35. ISBN 978-3-540-70574-1. https://resolver.caltech.edu/CaltechAUTHORS:20191112-131623581 Hallgren, Sean and Kolla, Alexandra and Sen, Pranab et al. (2008) Making Classical Honest Verifier Zero Knowledge Protocols Secure against Quantum Attacks. In: Automata, Languages and Programming. Lecture Notes in Computer Science. Vol.2. No.5126. Springer , Berlin, pp. 592-603. ISBN 9783540705826. https://resolver.caltech.edu/CaltechAUTHORS:20180809-133557708 |
