×

zbMATH — the first resource for mathematics

Found 311 Documents (Results 1–100)

Hits per Page
100
Display Format
MathJax
Result Sorting
Newest 1st
Gavinsky, Dmitry
Bare quantum simultaneity versus classical interactivity in communication complexity. (English) Zbl 07298257
Makarychev, Konstantin (ed.) et al., Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC ’20, Chicago, IL, USA, June 22–26, 2020. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-6979-4). 401-411 (2020).
MSC:  68Qxx
PDF BibTeX XML Cite
\textit{D. Gavinsky}, in: Proceedings of the 52nd annual ACM SIGACT symposium on theory of computing, STOC '20, Chicago, IL, USA, June 22--26, 2020. New York, NY: Association for Computing Machinery (ACM). 401--411 (2020; Zbl 07298257)
Full Text: DOI
Dinesh, Krishnamoorthy; Sarma, Jayalal
Sensitivity, affine transforms and quantum communication complexity. (English) Zbl 1453.68083
Du, Ding-Zhu (ed.) et al., Computing and combinatorics. 25th international conference, COCOON 2019, Xi’an, China, July 29–31, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11653, 140-152 (2019).
MSC:  68Q11 06E30 68Q12
PDF BibTeX XML Cite
\textit{K. Dinesh} and \textit{J. Sarma}, Lect. Notes Comput. Sci. 11653, 140--152 (2019; Zbl 1453.68083)
Full Text: DOI
Bohdanowicz, Thomas C.; Crosson, Elizabeth; Nirkhe, Chinmay; Yuen, Henry
Good approximate quantum LDPC codes from spacetime circuit Hamiltonians. (English) Zbl 1436.81029
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 481-490 (2019).
MSC:  81P73 68Q12 81Q10
PDF BibTeX XML Cite
\textit{T. C. Bohdanowicz} et al., in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 481--490 (2019; Zbl 1436.81029)
Full Text: DOI
Aaronson, Scott; Rothblum, Guy N.
Gentle measurement of quantum states and differential privacy. (English) Zbl 1433.68124
Charikar, Moses (ed.) et al., Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC ’19, Phoenix, AZ, USA, June 23–26, 2019. New York, NY: Association for Computing Machinery (ACM). 322-333 (2019).
MSC:  68P27 68Q12 81P15 81P45
PDF BibTeX XML Cite
\textit{S. Aaronson} and \textit{G. N. Rothblum}, in: Proceedings of the 51st annual ACM SIGACT symposium on theory of computing, STOC '19, Phoenix, AZ, USA, June 23--26, 2019. New York, NY: Association for Computing Machinery (ACM). 322--333 (2019; Zbl 1433.68124)
Full Text: DOI
Coecke, Bob (ed.); Lambert-Mogiliansky, Ariane (ed.)
Quantum interaction. 11th international conference, QI 2018, Nice, France, September 3–5, 2018. Revised selected papers. (English) Zbl 1428.68014
Lecture Notes in Computer Science 11690. Cham: Springer (ISBN 978-3-030-35894-5/pbk; 978-3-030-35895-2/ebook). viii, 193 p. (2019).
MSC:  68-06 81-06 68Q12 81P68 81P40 81P45 00B25
PDF BibTeX XML Cite
\textit{B. Coecke} (ed.) and \textit{A. Lambert-Mogiliansky} (ed.), Quantum interaction. 11th international conference, QI 2018, Nice, France, September 3--5, 2018. Revised selected papers. Cham: Springer (2019; Zbl 1428.68014)
Full Text: DOI
Wigderson, Avi
Mathematics and computation. A theory revolutionizing technology and science. (English) Zbl 1455.68004
Princeton, NJ: Princeton University Press (ISBN 978-0-691-18913-0/hbk; 978-0-691-19254-3/ebook). xiii, 418 p. (2019).
Reviewer: Peter Kostolányi (Bratislava)
MSC:  68-01 68Q01 68Q15 68Q25
PDF BibTeX XML Cite
\textit{A. Wigderson}, Mathematics and computation. A theory revolutionizing technology and science. Princeton, NJ: Princeton University Press (2019; Zbl 1455.68004)
Full Text: DOI
Ablayev, Farid; Ambainis, Andris; Khadiev, Kamil; Khadieva, Aliya
Lower bounds and hierarchies for quantum memoryless communication protocols and quantum ordered binary decision diagrams with repeated test. (English) Zbl 1444.68074
Tjoa, A Min (ed.) et al., SOFSEM 2018: theory and practice of computer science. 44th international conference on current trends in theory and practice of computer science, Krems, Austria, January 29 – February 2, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10706, 197-211 (2018).
MSC:  68Q12 68Q11 68Q17
PDF BibTeX XML Cite
\textit{F. Ablayev} et al., Lect. Notes Comput. Sci. 10706, 197--211 (2018; Zbl 1444.68074)
Full Text: DOI
Efremenko, Klim; Kol, Gillat; Saxena, Raghuvansh
Interactive coding over the noisy broadcast channel. (English) Zbl 1428.94046
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 507-520 (2018).
MSC:  94A24 68M12 68M14 94A40
PDF BibTeX XML Cite
\textit{K. Efremenko} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 507--520 (2018; Zbl 1428.94046)
Full Text: DOI
Leung, Debbie; Nayak, Ashwin; Shayeghi, Ala; Touchette, Dave; Yao, Penghui; Yu, Nengkun
Capacity approaching coding for low noise interactive quantum communication. (English) Zbl 1428.81044
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 339-352 (2018).
MSC:  81P45 68Q12
PDF BibTeX XML Cite
\textit{D. Leung} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 339--352 (2018; Zbl 1428.81044)
Full Text: DOI
Aaronson, Scott
Shadow tomography of quantum states. (English) Zbl 1427.81018
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 325-338 (2018).
MSC:  81P68 68Q12 81P45
PDF BibTeX XML Cite
\textit{S. Aaronson}, in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 325--338 (2018; Zbl 1427.81018)
Full Text: DOI
Christandl, Matthias; Vrana, Péter; Zuiddam, Jeroen
Universal points in the asymptotic spectrum of tensors. (English) Zbl 1427.68116
Diakonikolas, Ilias (ed.) et al., Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC ’18, Los Angeles, CA, USA, June 25–29, 2018. New York, NY: Association for Computing Machinery (ACM). 289-296 (2018).
MSC:  68Q25 15A69 68R05 68W30 81P45
PDF BibTeX XML Cite
\textit{M. Christandl} et al., in: Proceedings of the 50th annual ACM SIGACT symposium on theory of computing, STOC '18, Los Angeles, CA, USA, June 25--29, 2018. New York, NY: Association for Computing Machinery (ACM). 289--296 (2018; Zbl 1427.68116)
Full Text: DOI arXiv
Le Gall, François; Nakajima, Shogo
Multiparty quantum communication complexity of triangle finding. (English) Zbl 1427.68088
Wilde, Mark M. (ed.), 12th conference on the theory of quantum computation, communication and cryptography, TQC 2017, June 14–16, 2017, Paris, France. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 73, Article 6, 11 p. (2018).
MSC:  68Q12 68Q11 81P68
PDF BibTeX XML Cite
\textit{F. Le Gall} and \textit{S. Nakajima}, LIPIcs -- Leibniz Int. Proc. Inform. 73, Article 6, 11 p. (2018; Zbl 1427.68088)
Full Text: DOI
Backens, Miriam
A new Holant dichotomy inspired by quantum computation. (English) Zbl 1441.68159
Chatzigiannakis, Ioannis (ed.) et al., 44th international colloquium on automata, languages, and programming, ICALP 2017, Warsaw, Poland July 10–14, 2017. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 80, Article 16, 14 p. (2017).
MSC:  68R10 68Q25 81P45 81P68
PDF BibTeX XML Cite
\textit{M. Backens}, LIPIcs -- Leibniz Int. Proc. Inform. 80, Article 16, 14 p. (2017; Zbl 1441.68159)
Full Text: DOI
Klauck, Hartmut
The complexity of quantum disjointness. (English) Zbl 1441.68059
Larsen, Kim G. (ed.) et al., 42nd international symposium on mathematical foundations of computer science, MFCS 2017, August 21–25, 2017, Aalborg, Denmark. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 83, Article 15, 13 p. (2017).
MSC:  68Q12 68Q11
PDF BibTeX XML Cite
\textit{H. Klauck}, LIPIcs -- Leibniz Int. Proc. Inform. 83, Article 15, 13 p. (2017; Zbl 1441.68059)
Full Text: DOI
Anshu, Anurag; Ben-David, Shalev; Garg, Ankit; Jain, Rahul; Kothari, Robin; Lee, Troy
Separating quantum communication and approximate rank. (English) Zbl 1440.68095
O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 24, 33 p. (2017).
MSC:  68Q12 68Q11 81P45 81P68
PDF BibTeX XML Cite
\textit{A. Anshu} et al., LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 24, 33 p. (2017; Zbl 1440.68095)
Full Text: DOI
Nayak, Ashwin; Touchette, Dave
Augmented index and quantum streaming algorithms for Dyck(2). (English) Zbl 1440.68100
O’Donnell, Ryan (ed.), 32nd computational complexity conference, CCC 2017, July 6–9, 2017, Riga, Latvia. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 79, Article 23, 21 p. (2017).
MSC:  68Q12 68Q11 68W27 81P45 81P68
PDF BibTeX XML Cite
\textit{A. Nayak} and \textit{D. Touchette}, LIPIcs -- Leibniz Int. Proc. Inform. 79, Article 23, 21 p. (2017; Zbl 1440.68100)
Full Text: DOI
Buhrman, Harry; Christandl, Matthias; Zuiddam, Jeroen
Nondeterministic quantum communication complexity: the cyclic equality game and iterated matrix multiplication. (English) Zbl 1402.68063
Papadimitriou, Christos H. (ed.), 8th innovations in theoretical computer science conference, ITCS 2017, Berkeley, CA, USA, January 9–11, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-029-3). LIPIcs – Leibniz International Proceedings in Informatics 67, Article 24, 18 p. (2017).
MSC:  68Q12 68Q10 81P45 81P68
PDF BibTeX XML Cite
\textit{H. Buhrman} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 24, 18 p. (2017; Zbl 1402.68063)
Full Text: DOI
Kawachi, Akinori; Kawano, Kenichi; Le Gall, François; Tamaki, Suguru
Quantum query complexity of unitary operator discrimination. (English) Zbl 1434.68178
Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 309-320 (2017).
MSC:  68Q12 81P45 81Q12
PDF BibTeX XML Cite
\textit{A. Kawachi} et al., Lect. Notes Comput. Sci. 10392, 309--320 (2017; Zbl 1434.68178)
Full Text: DOI
Anshu, Anurag; Touchette, Dave; Yao, Penghui; Yu, Nengkun
Exponential separation of quantum communication and classical information. (English) Zbl 1369.68204
Hatami, Hamed (ed.) et al., Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC ’17, Montreal, QC, Canada, June 19–23, 2017. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4528-6). 277-288 (2017).
MSC:  68Q05 68P30 68Q10 81P68
PDF BibTeX XML Cite
\textit{A. Anshu} et al., in: Proceedings of the 49th annual ACM SIGACT symposium on theory of computing, STOC '17, Montreal, QC, Canada, June 19--23, 2017. New York, NY: Association for Computing Machinery (ACM). 277--288 (2017; Zbl 1369.68204)
Full Text: DOI
Shaltiel, Ronen; Silbak, Jad
Explicit List-decodable codes with optimal rate for computationally bounded channels. (English) Zbl 1398.94241
Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 45, 38 p. (2016).
MSC:  94B60 68Q25 94A40 94B35
PDF BibTeX XML Cite
\textit{R. Shaltiel} and \textit{J. Silbak}, LIPIcs -- Leibniz Int. Proc. Inform. 60, Article 45, 38 p. (2016; Zbl 1398.94241)
Full Text: DOI
Jeffery, Stacey; Le Gall, François
Quantum communication complexity of distributed set joins. (English) Zbl 1398.68122
Faliszewski, Piotr (ed.) et al., 41st international symposium on mathematical foundations of computer science, MFCS 2016, Kraków, Poland, August 22–26, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-016-3). LIPIcs – Leibniz International Proceedings in Informatics 58, Article 54, 13 p. (2016).
MSC:  68P15 68Q10 68Q12
PDF BibTeX XML Cite
\textit{S. Jeffery} and \textit{F. Le Gall}, LIPIcs -- Leibniz Int. Proc. Inform. 58, Article 54, 13 p. (2016; Zbl 1398.68122)
Full Text: DOI
Ambainis, Andris; Kokainis, Martins; Kothari, Robin
Nearly optimal separations between communication (or query) complexity and partitions. (English) Zbl 1380.68209
Raz, Ran (ed.), 31st conference on computational complexity, CCC’16, Tokyo, Japan, May 29 – June 1, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-008-8). LIPIcs – Leibniz International Proceedings in Informatics 50, Article 4, 14 p. (2016).
MSC:  68Q25 68Q10 68Q12
PDF BibTeX XML Cite
\textit{A. Ambainis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 50, Article 4, 14 p. (2016; Zbl 1380.68209)
Full Text: DOI
Gavinsky, Dmitry
Entangled simultaneity versus classical interactivity in communication complexity. (English) Zbl 1373.68226
Wichs, Daniel (ed.) et al., Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC ’16, Cambridge, MA, USA, June 19–21, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4132-5). 877-884 (2016).
MSC:  68Q12 68Q10
PDF BibTeX XML Cite
\textit{D. Gavinsky}, in: Proceedings of the 48th annual ACM SIGACT symposium on theory of computing, STOC '16, Cambridge, MA, USA, June 19--21, 2016. New York, NY: Association for Computing Machinery (ACM). 877--884 (2016; Zbl 1373.68226)
Full Text: DOI
Laplante, Sophie; Laurière, Mathieu; Nolin, Alexandre; Roland, Jérémie; Senno, Gabriel
Robust Bell inequalities from communication complexity. (English) Zbl 1370.81042
Broadbent, Anne (ed.), 11th conference on the theory of quantum computation, communication and cryptography, TQC 2016, Berlin, Germany, September 27–29, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-019-4). LIPIcs – Leibniz International Proceedings in Informatics 61, Article 5, 24 p. (2016).
MSC:  81P45 68Q05 68Q17 81P15 81P68
PDF BibTeX XML Cite
\textit{S. Laplante} et al., LIPIcs -- Leibniz Int. Proc. Inform. 61, Article 5, 24~p. (2016; Zbl 1370.81042)
Full Text: DOI
Bai, Lu; Rossi, Luca; Ren, Peng; Zhang, Zhihong; Hancock, Edwin R.
A quantum Jensen-Shannon graph kernel using discrete-time quantum walks. (English) Zbl 1437.68135
Liu, Cheng-Lin (ed.) et al., Graph-based representations in pattern recognition. 10th IAPR-TC-15 international workshop, GbRPR 2015, Beijing, China, May 13–15, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9069, 252-261 (2015).
MSC:  68R10 05C81 68Q12 68T05 81P45
PDF BibTeX XML Cite
\textit{L. Bai} et al., Lect. Notes Comput. Sci. 9069, 252--261 (2015; Zbl 1437.68135)
Full Text: DOI
Chung, Kai-Min; Wu, Xiaodi; Yuen, Henry
Parallel repetition for entangled \(k\)-player games via fast quantum search. (English) Zbl 1388.68066
Zuckerman, David (ed.), 30th conference on computational complexity, CCC’15, Portland, OR, USA, June 17–19, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-81-1). LIPIcs – Leibniz International Proceedings in Informatics 33, 512-536 (2015).
MSC:  68Q12 68Q10 81P40 91A80
PDF BibTeX XML Cite
\textit{K.-M. Chung} et al., LIPIcs -- Leibniz Int. Proc. Inform. 33, 512--536 (2015; Zbl 1388.68066)
Full Text: DOI
Bottesch, Ralph Christian; Gavinsky, Dmitry; Klauck, Hartmut
Correlation in hard distributions in communication complexity. (English) Zbl 1375.68054
Garg, Naveen (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 18th international workshop on approximation algorithms for combinatorial optimization problems (APPROX 2015) and the 19th international workshop on randomization and computation (RANDOM 2015), Princeton, NJ, USA, August 24–26, 2015. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-89-7). LIPIcs – Leibniz International Proceedings in Informatics 40, 544-572 (2015).
MSC:  68Q10 68P30 68Q12 68Q15
PDF BibTeX XML Cite
\textit{R. C. Bottesch} et al., LIPIcs -- Leibniz Int. Proc. Inform. 40, 544--572 (2015; Zbl 1375.68054)
Full Text: DOI
Briët, Jop; Buhrman, Harry; Leung, Debbie; Piovesan, Teresa; Speelman, Florian
Round elimination in exact communication complexity. (English) Zbl 1366.68053
Beigi, Salman (ed.) et al., 10th conference on the theory of quantum computation, communication and cryptography, TQC’15, Brussels, Belgium, May 20–22, 2015. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-96-5). LIPIcs – Leibniz International Proceedings in Informatics 44, 206-225 (2015).
MSC:  68Q05 68Q10 68R10 81Q12
PDF BibTeX XML Cite
\textit{J. Briët} et al., LIPIcs -- Leibniz Int. Proc. Inform. 44, 206--225 (2015; Zbl 1366.68053)
Full Text: DOI
Braverman, Mark; Mao, Jieming
Simulating noisy channel interaction (extended abstract). (English) Zbl 1364.94351
Proceedings of the 6th conference on innovations in theoretical computer science, ITCS’15, Rehovot, Israel, January 11–13, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3333-7). 21-30 (2015).
MSC:  94A40 68P30
PDF BibTeX XML Cite
\textit{M. Braverman} and \textit{J. Mao}, in: Proceedings of the 6th conference on innovations in theoretical computer science, ITCS'15, Rehovot, Israel, January 11--13, 2015. New York, NY: Association for Computing Machinery (ACM). 21--30 (2015; Zbl 1364.94351)
Full Text: DOI
Fujii, Keisuke
Quantum computation with topological codes. From qubit to topological fault-tolerance. (English) Zbl 1339.81005
SpringerBriefs in Mathematical Physics 8. Singapore: Springer (ISBN 978-981-287-995-0/pbk; 978-981-287-996-7/ebook). x, 138 p. (2015).
Reviewer: Carlos Pedro Gonçalves (Lisboa)
MSC:  81-02 81P45 81P68 68Q12 81P70
PDF BibTeX XML Cite
\textit{K. Fujii}, Quantum computation with topological codes. From qubit to topological fault-tolerance. Singapore: Springer (2015; Zbl 1339.81005)
Full Text: DOI
Kaniewski, Jedrzej; Lee, Troy; de Wolf, Ronald
Query complexity in expectation. (English) Zbl 1440.68123
Halldórsson, Magnús M. (ed.) et al., Automata, languages, and programming. 42nd international colloquium, ICALP 2015, Kyoto, Japan, July 6–10, 2015. Proceedings. Part I. Berlin: Springer. Lect. Notes Comput. Sci. 9134, 761-772 (2015).
MSC:  68Q25 68Q11 68Q12 68Q87 90C22
PDF BibTeX XML Cite
\textit{J. Kaniewski} et al., Lect. Notes Comput. Sci. 9134, 761--772 (2015; Zbl 1440.68123)
Full Text: DOI
Touchette, Dave
Quantum information complexity. (English) Zbl 1321.94022
Proceedings of the 47th annual ACM symposium on theory of computing, STOC ’15, Portland, OR, USA, June 14–17, 2015. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-3536-2). 317-326 (2015).
MSC:  94A15 68Q12 81P45
PDF BibTeX XML Cite
\textit{D. Touchette}, in: Proceedings of the 47th annual ACM symposium on theory of computing, STOC '15, Portland, OR, USA, June 14--17, 2015. New York, NY: Association for Computing Machinery (ACM). 317--326 (2015; Zbl 1321.94022)
Full Text: DOI arXiv

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