×

Found 209 Documents (Results 1–100)

\(\mathsf{TC}^0\) circuits for algorithmic problems in nilpotent groups. (English) Zbl 1441.68044

Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 23, 14 p. (2017).

Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups. (English) Zbl 1392.68205

Kahrobaei, Delaram (ed.) et al., Algebra and computer science. Joint AMS-EMS-SPM meeting algebra and computer science, Porto, Portugal, June 10–13, 2015. Joint mathematics meetings groups, algorithms, and cryptography, San Antonio, TX, USA, January 10–13, 2015. Joint AMS-Israel Mathematical Union meeting applications of algebra to cryptography, Tel-Aviv, Israel, June 16–19, 2014. Proceedings. Providence, RI: American Mathematical Society (AMS) (ISBN 978-1-4704-2303-2/pbk; 978-1-4704-3587-5/ebook). Contemporary Mathematics 677, 129-144 (2016).

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software