×

Found 243 Documents (Results 1–100)

Analysis of eigenvalue condition numbers for a class of randomized numerical methods for singular matrix pencils. arXiv:2305.13118

Preprint, arXiv:2305.13118 [math.NA] (2023).
BibTeX Cite
Full Text: arXiv

Uniform approximations for randomized Hadamard transforms with applications. (English) Zbl 07774368

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 659-671 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Matrix discrepancy from quantum communication. (English) Zbl 07774366

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 637-648 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Matrix anti-concentration inequalities with applications. (English) Zbl 07774361

Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 568-581 (2022).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

The product of Gaussian matrices is close to Gaussian. (English) Zbl 07768380

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 35, 22 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Singularity of random integer matrices with large entries. (English) Zbl 07768378

Wootters, Mary (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 24th international conference, APPROX 2021, and 25th international conference, RANDOM 2021, University of Washington, Seattle, Washington, US (virtual conference), August 16–18, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 207, Article 33, 16 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Support of closed walks and second eigenvalue multiplicity of graphs. (English) Zbl 07765180

Khuller, Samir (ed.) et al., Proceedings of the 53rd annual ACM SIGACT symposium on theory of computing, STOC ’21, virtual, Italy, June 21–25, 2021. New York, NY: Association for Computing Machinery (ACM). 396-407 (2021).
MSC:  68Qxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Efficient Gauss elimination for near-quadratic matrices with one short random block per row, with applications. (English) Zbl 07525476

Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 39, 18 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tight bounds for \(\ell_p\) oblivious subspace embeddings. (English) Zbl 1432.68373

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1825-1843 (2019).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Recovering structured probability matrices. (English) Zbl 1462.68157

Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 46, 14 p. (2018).
MSC:  68T05 60B20 62H12
PDFBibTeX XMLCite
Full Text: DOI arXiv

Lectures on randomized numerical linear algebra. (English) Zbl 1448.68004

Mahoney, Michael W. (ed.) et al., The mathematics of data. Lecture notes from the 26th IAS/Park City Mathematics Institute (PCMI) Summer School, Park City, UT, USA, July 2016. Providence, RI: American Mathematical Society (AMS); Princeton, NJ: Institute for Advanced Study (IAS); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). IAS/Park City Math. Ser. 25, 1-48 (2018).
PDFBibTeX XMLCite
Full Text: arXiv

Tight query complexity lower bounds for PCA via finite sample deformed Wigner law. (English) Zbl 1428.68168

Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 1249-1259 (2018).
MSC:  68Q17 15B52 62H25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Probabilistic logarithmic-space algorithms for Laplacian solvers. (English) Zbl 1467.68212

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 20th international workshop, APPROX 2017 and 21st international workshop, RANDOM 2017, Berkeley, CA, USA, August 16–18, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 81, Article 41, 20 p. (2017).
MSC:  68W20 05C50 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