×

Found 182 Documents (Results 1–100)

Formalizing algorithmic bounds in the query model in EeasyCrypt. (English) Zbl 07881143

Andronick, June (ed.) et al., 13th international conference on interactive theorem proving, ITP 2022, Haifa, Israel, August 7–10, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 237, Article 30, 21 p. (2022).
MSC:  68V15
Full Text: DOI

Almost simplicial polytopes: the lower and upper bound theorems. (English. French summary) Zbl 1465.52023

Proceedings of the 28th international conference on formal power series and algebraic combinatorics, FPSAC 2016, Vancouver, Canada, July 4–8, 2016. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Math. Theor. Comput. Sci., Proc., 947-958 (2020).
MSC:  52B05

Randomized query complexity of sabotaged and composed functions. (English) Zbl 1388.68094

Chatzigiannakis, Ioannis (ed.) et al., 43rd international colloquium on automata, languages, and programming, ICALP 2016, Rome, Italy, July 12–15, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-013-2). LIPIcs – Leibniz International Proceedings in Informatics 55, Article 60, 14 p. (2016).
MSC:  68Q17 68Q10 68W20
Full Text: DOI

Proof complexity of resolution-based QBF calculi. (English) Zbl 1355.68105

Mayr, Ernst W. (ed.) et al., 32nd international symposium on theoretical aspects of computer science, STACS’15, Garching, Germany, March 4–7, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-78-1). LIPIcs – Leibniz International Proceedings in Informatics 30, 76-89 (2015).
MSC:  68Q17 03F20 68T15
Full Text: DOI

The lower bound theorem for polytopes that approximate \(C^1\)-convex bodies. (English. French summary) Zbl 1394.52007

Proceedings of the 26th international conference on formal power series and algebraic combinatorics, FPSAC 2014, Chicago, IL, USA, June 29 – July 3, 2014. Nancy: The Association. Discrete Mathematics & Theoretical Computer Science (DMTCS). Discrete Mathematics and Theoretical Computer Science. Proceedings, 277-288 (2014).
MSC:  52B05 52A40 52B70

Deformations of Siegel-Hilbert Hecke eigensystems and their Galois representations. (English) Zbl 1020.11036

Murty, V. Kumar (ed.) et al., Number theory. Proceedings of the international conference on discrete mathematics and number theory, Tiruchirapalli, India, January 3-6, 1996 on the occasion of the 10th anniversary of the Ramanujan Mathematical Society. Providence, RI: American Mathematical Society. Contemp. Math. 210, 195-225 (1998).

Metric geometry: Connections with combinatorics. (English) Zbl 0841.53040

Billera, Louis J. (ed.) et al., Formal power series and algebraic combinatorics. Séries formelles et combinatoire algébrique 1994. Invited lectures presented at the 6th international DIMACS workshop, May 23-27, 1994. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 24, 55-69 (1996).
MSC:  53C23 52B05 52C35

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