×

zbMATH — the first resource for mathematics

Found 42 Documents (Results 1–42)

100
MathJax
Zhu, Daming (ed.) et al., Frontiers in algorithmics. 10th international workshop, FAW 2016, Qingdao, China, June 30 – July 2, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-39816-7/pbk; 978-3-319-39817-4/ebook). Lecture Notes in Computer Science 9711, 111-124 (2016).
MSC:  68Wxx
PDF BibTeX XML Cite
Full Text: DOI
Creignou, Nadia (ed.) et al., Theory and applications of satisfiability testing – SAT 2016. 19th international conference, Bordeaux, France, July 5–8, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-40969-6/pbk; 978-3-319-40970-2/ebook). Lecture Notes in Computer Science 9710, 60-76 (2016).
MSC:  68Q25 68T20
PDF BibTeX XML Cite
Full Text: DOI
Davis, Martin (ed.) et al., Logic for programming, artificial intelligence, and reasoning. 20th international conference, LPAR-20 2015, Suva, Fiji, November 24–28, 2015. Proceedings. Berlin: Springer (ISBN 978-3-662-48898-0/pbk; 978-3-662-48899-7/ebook). Lecture Notes in Computer Science 9450, 48-62 (2015).
MSC:  03B70 68T27
PDF BibTeX XML Cite
Full Text: DOI
Heule, Marijn (ed.) et al., Theory and applications of satisfiability testing – SAT 2015. 18th international conference, Austin, TX, USA, September 24–27, 2015. Proceedings. Cham: Springer (ISBN 978-3-319-24317-7/pbk; 978-3-319-24318-4/pbk). Lecture Notes in Computer Science 9340, 33-45 (2015).
MSC:  68Q25 68T20
PDF BibTeX XML Cite
Full Text: DOI
Kleine Büning, Hans (ed.) et al., Theory and applications of satisfiability testing – SAT 2008. 11th international conference, SAT 2008, Guangzhou, China, May 12–15, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-79718-0/pbk). Lecture Notes in Computer Science 4996, 139-152 (2008).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI
Bessière, Christian (ed.), Principles and practice of constraint programming – CP 2007. 13th international conference, CP 2007, Providence, RI, USA, September 23–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74969-1/pbk). Lecture Notes in Computer Science 4741, 225-240 (2007).
MSC:  68T20
PDF BibTeX XML Cite
Full Text: DOI
Lingas, Andrzej (ed.) et al., Fundamentals of computation theory. 14th international symposium, FCT 2003, Malmö, Sweden, August 12–15, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40543-7/pbk). Lect. Notes Comput. Sci. 2751, 2-14 (2003).
PDF BibTeX XML Cite
Full Text: DOI
Proceedings of the 11th annual ACM-SIAM symposium on Discrete algorithms. San Francisco, CA, USA, January 9-11, 2000. Philadelphia, PA: SIAM. 96-105 (2000).
MSC:  90B80
PDF BibTeX XML Cite
Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. International ICALP ’98 workshop, APPROX ’98, Aalborg, Denmark, July 18–19, 1998. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1444, 193-199 (1998).
MSC:  68Q05 68Q45
PDF BibTeX XML Cite
Johnson, David S. (ed.) et al., Cliques, coloring, and satisfiability. Second DIMACS implementation challenge. Proceedings of a workshop held at DIMACS, October 11–13, 1993. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 26, 587-615 (1996).
PDF BibTeX XML Cite

Filter Results by …

Document Type
Reviewing State
all top 5
Author
all top 5
Year of Publication
all top 3
Classification
all top 3
Software