×

Found 33,213 Documents (Results 1–100)

Generalized sparsity-promoting solvers for Bayesian inverse problems: Versatile sparsifying transforms and unknown noise variances. arXiv:2402.16623

Preprint, arXiv:2402.16623 [math.NA] (2024).
BibTeX Cite
Full Text: arXiv

Tree decompositions meet induced matchings: beyond Max Weight Independent Set. arXiv:2402.15834

Preprint, arXiv:2402.15834 [cs.DS] (2024).
BibTeX Cite
Full Text: arXiv

The evaluation complexity of finding high-order minimizers of nonconvex optimization. (English) Zbl 07822593

Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 7. Sections 15–20. Berlin: European Mathematical Society (EMS). 5256-5289 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Discrepancy theory and related algorithms. (English) Zbl 07822590

Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 7. Sections 15–20. Berlin: European Mathematical Society (EMS). 5178-5210 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Polyhedral techniques in combinatorial optimization: matchings and tours. (English) Zbl 07821718

Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 6. Sections 12–14. Berlin: European Mathematical Society (EMS). 4970-4994 (2023).
PDFBibTeX XMLCite
Full Text: DOI

On the computation complexity of the systems of finite abelian group elements. (English. Russian original) Zbl 07805960

Mosc. Univ. Math. Bull. 78, No. 4, 179-187 (2023); translation from Vestn. Mosk. Univ., Ser. I 78, No. 4, 22-29 (2023).
MSC:  20K01 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Finding short integer solutions when the modulus is small. (English) Zbl 07799255

Handschuh, Helena (ed.) et al., Advances in cryptology – CRYPTO 2023. 43rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 14083, 150-176 (2023).
PDFBibTeX XMLCite
Full Text: DOI

How to recover a secret with \(O(n)\) additions. (English) Zbl 07799096

Handschuh, Helena (ed.) et al., Advances in cryptology – CRYPTO 2023. 43rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14081, 236-262 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Arithmetic sketching. (English) Zbl 07799094

Handschuh, Helena (ed.) et al., Advances in cryptology – CRYPTO 2023. 43rd annual international cryptology conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20–24, 2023. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 14081, 171-202 (2023).
PDFBibTeX XMLCite
Full Text: DOI

Quantum search-to-decision reduction for the LWE problem. (English) Zbl 07798843

El Mrabet, Nadia (ed.) et al., Progress in cryptology – AFRICACRYPT 2023. 14th international conference on cryptology in Africa, Sousse, Tunisia, July 19–21, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14064, 395-413 (2023).
PDFBibTeX XMLCite
Full Text: DOI

MinRank in the head. Short signatures from zero-knowledge proofs. (English) Zbl 07798827

El Mrabet, Nadia (ed.) et al., Progress in cryptology – AFRICACRYPT 2023. 14th international conference on cryptology in Africa, Sousse, Tunisia, July 19–21, 2023. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 14064, 3-27 (2023).
MSC:  94A62 94A60 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software