×

Found 95 Documents (Results 1–95)

Towards the automatic mathematician. (English) Zbl 1510.68116

Platzer, André (ed.) et al., Automated deduction – CADE 28. 28th international conference on automated deduction, virtual event, July 12–15, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12699, 25-37 (2021).
PDFBibTeX XMLCite
Full Text: DOI

The Moser-Tardos resample algorithm: where is the limit? (An experimental inquiry). (English) Zbl 1430.68466

Fekete, Sándor (ed.) et al., Proceedings of the 19th workshop on algorithm engineering and experiments, ALENEX ’17, Barcelona, Spain, January 17–18, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 159-171 (2017).
PDFBibTeX XMLCite
Full Text: DOI

Deep network guided proof search. (English) Zbl 1403.68197

Eiter, Thomas (ed.) et al., LPAR-21. 21st international conference on logic for programming, artificial intelligence and reasoning, Maun, Botswana, May 8–12, 2017. Selected papers. Manchester: EasyChair. EPiC Series in Computing 46, 85-105 (2017).
MSC:  68T05 68T15
PDFBibTeX XMLCite
Full Text: DOI arXiv

The garden hose complexity for the equality function. (English) Zbl 1445.68101

Gu, Qianping (ed.) et al., Algorithmic aspects in information and management. 10th international conference, AAIM 2014, Vancouver, BC, Canada, July 8–11, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8546, 112-123 (2014).
MSC:  68Q11 20B99 81P94
PDFBibTeX XMLCite
Full Text: DOI arXiv

Digital signatures with minimal overhead from indifferentiable random invertible functions. (English) Zbl 1310.94156

Canetti, Ran (ed.) et al., Advances in cryptology – CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18–22, 2013. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-40040-7/pbk). Lecture Notes in Computer Science 8042, 571-588 (2013).
MSC:  94A60
PDFBibTeX XMLCite
Full Text: DOI

The Lovász local lemma – a survey. (English) Zbl 1381.05083

Bulatov, Andrei A. (ed.) et al., Computer science – theory and applications. 8th international computer science symposium in Russia, CSR 2013, Ekaterinburg, Russia, June 25–29, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38535-3/pbk). Lecture Notes in Computer Science 7913, 1-11 (2013).
MSC:  05D40 60C05
PDFBibTeX XMLCite
Full Text: DOI

Streaming and communication complexity of clique approximation. (English) Zbl 1272.68333

Czumaj, Artur (ed.) et al., Automata, languages, and programming. 39th international colloquium, ICALP 2012, Warwick, UK, July 9–13, 2012. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-31593-0/pbk). Lecture Notes in Computer Science 7391, 449-460 (2012).
PDFBibTeX XMLCite
Full Text: DOI

A sharper local lemma with improved applications. (English) Zbl 1372.05230

Gupta, Anupam (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 15th international workshop, APPROX 2012, and 16th international workshop, RANDOM 2012, Cambridge, MA, USA, August 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 603-614 (2012).
MSC:  05D40 05C15 60C05
PDFBibTeX XMLCite
Full Text: DOI

Quantum query complexity of state conversion. (English) Zbl 1292.68069

Ostrovsky, Rafail (ed.), Proceedings of the 2011 IEEE 52nd annual symposium on foundations of computer science – FOCS 2011, Palm Springs, CA, USA, October 22–25. Los Alamitos, CA: IEEE Computer Society (ISBN 978-0-7695-4571-4; 978-1-4577-1843-4/ebook). 344-353 (2011).
MSC:  68Q12 81P68
PDFBibTeX XMLCite
Full Text: DOI arXiv

Moser and Tardos meet Lovász. (English) Zbl 1288.68129

Proceedings of the 43rd annual ACM symposium on theory of computing, STOC ’11. San Jose, CA, USA, June 6–8, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0691-1). 235-244 (2011).
PDFBibTeX XMLCite
Full Text: DOI

Streaming algorithms for independent sets. (English) Zbl 1288.68189

Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 641-652 (2010).
MSC:  68R10 05C69 05C85
PDFBibTeX XMLCite
Full Text: DOI

A new line of attack on the dichotomy conjecture. (English) Zbl 1304.68076

Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 725-734 (2009).
MSC:  68Q25 08A40 68Q17
PDFBibTeX XMLCite
Full Text: DOI Link

Amortized communication complexity of distributions. (English) Zbl 1248.68261

Albers, Susanne (ed.) et al., Automata, languages and programming. 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5–12, 2009. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-02926-4/pbk). Lecture Notes in Computer Science 5555, 738-749 (2009).
MSC:  68Q25 68M12
PDFBibTeX XMLCite
Full Text: DOI Link

Delaunay graphs of point sets in the plane with respect to axis-parallel rectangles. (English) Zbl 1192.05099

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 94-101 (2008).
PDFBibTeX XMLCite

Parallel repetition of the odd cycle game. (English) Zbl 1136.68407

Laber, Eduardo Sany (ed.) et al., LATIN 2008: Theoretical informatics. 8th Latin American symposium, Búzios, Brazil, April 7–11, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-78772-3/pbk). Lecture Notes in Computer Science 4957, 676-686 (2008).
PDFBibTeX XMLCite
Full Text: DOI

Product rules in semidefinite programming. (English) Zbl 1135.90378

Csuhaj-Varjú, Erzsébet (ed.) et al., Fundamentals of computation theory. 16th international symposium, FCT 2007, Budapest, Hungary, August 27–30, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-74239-5/pbk). Lecture Notes in Computer Science 4639, 435-445 (2007).
PDFBibTeX XMLCite
Full Text: DOI

Languages with bounded multiparty communication complexity. (English) Zbl 1186.68249

Thomas, Wolfgang (ed.) et al., STACS 2007. 24th annual symposium on theoretical aspects of computer science, Aachen, Germany, February 22–24, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-70917-6/pbk). Lecture Notes in Computer Science 4393, 500-511 (2007).
MSC:  68Q45 68Q25
PDFBibTeX XMLCite
Full Text: DOI

The DLT priority sampling is essentially optimal. (English) Zbl 1301.68166

Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 150-158 (2006).
PDFBibTeX XMLCite
Full Text: DOI

A dichotomy theorem for typed constraint satisfaction problems. (English) Zbl 1187.68257

Biere, Armin (ed.) et al., Theory and applications of satisfiability testing – SAT 2006. 9th international conference, Seattle, WA, USA, August 12–15, 2006. Proceedings. Berlin: Springer (ISBN 3-540-37206-7/pbk). Lecture Notes in Computer Science 4121, 226-239 (2006).
MSC:  68Q25 68T20
PDFBibTeX XMLCite
Full Text: DOI

Quantum algorithms for the triangle problem. (English) Zbl 1297.68078

Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 1109-1117 (2005).
MSC:  68Q12 05C85
PDFBibTeX XMLCite

All quantum adversary methods are equivalent. (English) Zbl 1081.68025

Caires, Luís (ed.) et al., Automata, languages and programming. 32nd international colloquium, ICALP 2005, Lisbon, Portugal, July 11–15, 2005. Proceedings. Berlin: Springer (ISBN 3-540-27580-0/pbk). Lecture Notes in Computer Science 3580, 1299-1311 (2005).
MSC:  68Q17 81P68
PDFBibTeX XMLCite
Full Text: DOI

Quantum and classical query complexities of local search are polynomially related. (English) Zbl 1192.68266

Proceedings of the 36th annual ACM symposium on theory of computing (STOC 2004), Chicago, IL, USA, June 13 - 15, 2004. New York, NY: ACM Press (ISBN 1-58113-852-0). 494-501, electronic only (2004).
MSC:  68Q05 68Q10 68Q25 81P68
PDFBibTeX XMLCite
Full Text: DOI

Long monotone paths in line arrangements. (English) Zbl 1376.52040

Proceedings of the 19th annual symposium on computational geometry, SCG/SoCG 2003, San Diego, CA, USA, June 8–10, 2003. New York, NY: Association for Computing Machinery (ACM) (ISBN 1-58113-663-3). 124-128 (2003).
MSC:  52C30 52C35 68U05
PDFBibTeX XMLCite
Full Text: DOI

Computing Boolean functions from multiple faulty copies of input bits. (English) Zbl 1059.68575

Rajsbaum, Sergio (ed.), LATIN 2002: Theoretical informatics. 5th Latin American symposium, Cancun, Mexico, April 3–6, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43400-3). Lect. Notes Comput. Sci. 2286, 539-553 (2002).
MSC:  68Q05 68Q17 68Q25 68R05 90C09 94C12
PDFBibTeX XMLCite
Full Text: Link

A clique size bounding technique with application to nonlinear codes. (English) Zbl 0948.94020

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. S 971-S 972 (1999).
MSC:  94B60 05C69 94B65
PDFBibTeX XMLCite

Just the fax-differentiating voice and fax phone lines using call billing data. (English) Zbl 1012.68537

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. S 935-S 936 (1999).
MSC:  68T10
PDFBibTeX XMLCite

What are the least tractable instances of max independent set? (English) Zbl 0929.68089

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17–19, 1999. Philadelphia, PA: SIAM. S 927-S 928 (1999).
MSC:  68R10 05C05
PDFBibTeX XMLCite

On-line complexity of monotone set systems (extended abstract). (English) Zbl 0947.91018

Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms. Baltimore, MD, USA, January 17-19, 1999. Philadelphia, PA: SIAM. 507-516 (1999).
MSC:  91A99 68Q25
PDFBibTeX XMLCite

Public vs. private coin flips in one round communication games. (Extended abstract). (English) Zbl 0936.68050

Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22-24, 1996. New York, NY: ACM, 561-570 (1996).
MSC:  68Q15 68R10
PDFBibTeX XMLCite

The space complexity of approximating the frequency moments. (English) Zbl 0922.68057

Proceedings of the 28th annual ACM symposium on the theory of computing (STOC). Philadelphia, PA, USA, May 22–24, 1996. New York, NY: ACM, 20-29 (1996).
MSC:  68Q25 68P99 68W20
PDFBibTeX XMLCite

On the power of two-local random reductions. (English) Zbl 0823.68035

Imai, Hideki (ed.) et al., Advances in Cryptology - ASIACRYPT ’91. International conference on the theory and application of cryptology, Fujiyoshida, Japan, November 11-14, 1991. Proceedings. Berlin: Springer- Verlag. Lect. Notes Comput. Sci. 739, 346-351 (1993).
MSC:  68P25 94A60
PDFBibTeX XMLCite

Locality based graph coloring. (English) Zbl 1310.05099

Proceedings of the 25th annual ACM symposium on theory of computing, STOC ’93. San Diego, CA, USA, May 16–18, 1993. New York, NY: Association for Computing Machinery (ACM) (ISBN 0-89791-591-7). 201-207 (1993).
PDFBibTeX XMLCite
Full Text: DOI

Lower bounds for on-line graph coloring. (English) Zbl 0829.68096

Frederickson, Greg (ed.), Proceedings of the third annual ACM-SIAM symposium on discrete algorithms, held January 27-29, 1992, in Orlando, FL, USA. Philadelphia, PA: SIAM. 211-216 (1992).
PDFBibTeX XMLCite

Proof verification and hardness of approximation problems. (English) Zbl 0977.68539

33rd annual symposium on Foundations of computer science (FOCS). Proceedings, Pittsburgh, PA, USA, October 24-27, 1992. Washington, DC: IEEE Computer Society Press, 14-23 (1992).
MSC:  68Q15 68N15
PDFBibTeX XMLCite

Filter Results by …

Document Type

Database

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

all top 3

Software