×

Found 45 Documents (Results 1–45)

Matrix multiplication: verifying strong uniquely solvable puzzles. (English) Zbl 07331039

Pulina, Luca (ed.) et al., Theory and applications of satisfiability testing – SAT 2020. 23rd international conference, Alghero, Italy, July 3–10, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12178, 464-480 (2020).
MSC:  68Q25 68R07 68T20
PDFBibTeX XMLCite
Full Text: DOI

Improved lower bounds for testing triangle-freeness in Boolean functions via fast matrix multiplication. (English) Zbl 1359.68101

Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 17th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2014) and the 18th international workshop on randomization and computation (RANDOM 2014), Universitat Politècnica de Catalunya, Barcelona, Spain, September 4–6, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-74-3). LIPIcs – Leibniz International Proceedings in Informatics 28, 669-676 (2014).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software