×

Found 15 Documents (Results 1–15)

Lower bounds for XOR of forrelations. (English) Zbl 07768397

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 52, 14 p. (2021).
MSC:  68W20 68W25 90C27
PDFBibTeX XMLCite
Full Text: DOI arXiv

Detecting communities is hard (and counting them is even harder). (English) Zbl 1402.68106

Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 42, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Deciding parity games in quasipolynomial time. (English) Zbl 1369.68234

Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 252-263 (2017).
MSC:  68Q25 91A43
PDFBibTeX XMLCite
Full Text: DOI

Deterministic and probabilistic binary search in graphs. (English) Zbl 1376.68064

Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 519-532 (2016).
PDFBibTeX XMLCite
Full Text: DOI arXiv

Local Euler-Maclaurin expansion of Barvinok valuations and Ehrhart coefficients of a rational polytope. (English) Zbl 1162.52008

Beck, Matthias (ed.) et al., Integer points in polyhedra—geometry, number theory, algebra, optimization, statistics. Proceedings of the AMS-IMS-SIAM joint summer research conference, Snowbird, UT, USA, June 11–15, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4173-0/pbk). Contemporary Mathematics 452, 15-33 (2008).
MSC:  52B45 52B20
PDFBibTeX XMLCite
Full Text: arXiv

Applied interval computation: A new approach for time-delays systems analysis. (English) Zbl 1246.93060

Chiasson, John (ed.) et al., Applications of time delay systems. Berlin: Springer (ISBN 978-3-540-49555-0/pbk). Lecture Notes in Control and Information Sciences 352, 175-197 (2007).
MSC:  93C05 93C15 65G40
PDFBibTeX XMLCite
Full Text: DOI

Towards lower bounds for bounded-depth Frege proofs with modular connectives. (English) Zbl 0891.03027

Beame, Paul W. (ed.) et al., Proof complexity and feasible arithmetics. Papers from the DIMACS workshop, Rutgers, NJ, USA, April 21–24, 1996. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 195-227 (1998).
MSC:  03F20 68Q15 03B35
PDFBibTeX XMLCite

Estimation of quasipolynomials in noise: Theoretical, algorithmic and implementation aspects. (English) Zbl 0927.93004

Warwick, Kevin (ed.) et al., Computer-intensive methods in control and signal processing. The curse of dimensionality. Basel: Birkhäuser. 223-235 (1997).
MSC:  93-04 93E10
PDFBibTeX XMLCite

On the zeros of some quasipolynomial. (English) Zbl 0925.44001

Rusev, P. (ed.) et al., Transform methods and special functions. Proceedings of the 1st international workshop, Bankya, Bulgaria, August 12–17, 1994. Sofia: SCT Publishing, 150-154 (1995).
MSC:  44A40 34A25
PDFBibTeX XMLCite

Filter Results by …

all top 5

Year of Publication

all top 3

Main Field

Software