×

Found 7 Documents (Results 1–7)

Almost settling the hardness of noncommutative determinant. (English) Zbl 1288.68108

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). 499-508 (2011).
MSC:  68Q25 15A15 68W30
PDFBibTeX XMLCite
Full Text: DOI arXiv

Strong and Pareto price of anarchy in congestion games. (English) Zbl 1248.91009

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, 279-291 (2009).
MSC:  91A10
PDFBibTeX XMLCite
Full Text: DOI

Convergence to approximate Nash equilibria in congestion games. (English) Zbl 1303.91018

Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 169-178 (2007).
MSC:  91A10
PDFBibTeX XMLCite

Clifford algebras and approximating the permanent. (English) Zbl 1192.68885

Proceedings of the thirty-fourth annual ACM symposium on theory of computing (STOC 2002), Montreal, Quebec, Canada, May 19–21, 2002. New York, NY: ACM Press (ISBN 1-581-13495-9). 222-231 (2002).
MSC:  68W25 15A66
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

Year of Publication

all top 3

Main Field