×

Found 182 Documents (Results 1–100)

100
MathJax

Counting ascents in generalized Dyck paths. (English) Zbl 1482.05012

Fill, James Allen (ed.) et al., 29th international conference on probabilistic, combinatorial and asymptotic methods for the analysis of algorithms, AofA 2018, June 25–29, 2018, Uppsala, Sweden. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 110, Article 26, 15 p. (2018).
MSC:  05A15
PDF BibTeX XML Cite
Full Text: DOI arXiv

Enumeration complexity of logical query problems with second-order variables. (English) Zbl 1247.68073

Bezem, Marc (ed.), Computer science logic (CSL’11). 25th international workshop, 20th annual conference of the EACSL, Bergen, Norway, September 12–15, 2011. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-32-3). LIPIcs – Leibniz International Proceedings in Informatics 12, 189-202, electronic only (2011).
MSC:  68P15 03D15 68Q19
PDF BibTeX XML Cite
Full Text: DOI Link

Multiplicity results for an elliptic system. (English) Zbl 1339.05203

Akça, Haydar (ed.) et al., Proceedings of the international conference: 2004 – Dynamical systems and applications. Papers based on talks given at the conference, Antalya, Turkey, July 5–10, 2004. Dhahran: King Fahd University of Petroleum and Minerals, Department of Mathematical Sciences. 189-192, electronic only (2004).
PDF BibTeX XML Cite
Full Text: Link

The complexity of computing the number of self-avoiding walks in two-dimensional grid graphs and in hypercube graphs. (English) Zbl 0999.68088

Sgall, Jiří(ed.) et al., Mathematical foundations of computer science 2001. 26th international symposium, MFCS 2001, Mariánské Lázně, Czech Republic, August 27-31, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2136, 585-597 (2001).
MSC:  68Q25 03D15 05C30
PDF BibTeX XML Cite
Full Text: Link

Principles for the optimization of combinatorial procedures. Ed. by T. K. Shulikina. (Принципы оптимизации комбинаторых процедур.) (Russian) Zbl 0738.90062

Rostov-na-Donu: Izdatel’stvo Rostovskogo Universitete. 198 p. (1988).
PDF BibTeX XML Cite

Nonconvex programming. (Based on the first part of the Hungarian “Nemkonvex és diszkrét programozás”, Közgazdasági és Jogi Könyvkiadó, Budapest). (English) Zbl 0655.90046

Budapest: Akadémiai Kiadó. 188 p.; DM 45.00 (1988).
Reviewer: H.Tuy
MSC:  90C30 49M37 90-02
PDF BibTeX XML Cite

Filter Results by …

Document Type

Reviewing State

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Classification

all top 3

Software