Found 118 Documents (Results 1–100)
The no-meet matroid. (English) Zbl 07868440
The power of unentangled quantum proofs with non-negative amplitudes. (English) Zbl 07844699
Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 1629-1642 (2023).
MSC:
68Qxx
NLTS Hamiltonians from good quantum codes. (English) Zbl 07844656
Saha, Barna (ed.) et al., Proceedings of the 55th annual ACM SIGACT symposium on theory of computing, STOC ’23, Orlando, FL, USA, June 20–23, 2023. New York, NY: Association for Computing Machinery (ACM). 1090-1096 (2023).
MSC:
68Qxx
Mathematics of computation through the lens of linear equations and lattices. (English) Zbl 07821717
Beliaev, Dmitry (ed.) et al., International congress of mathematicians 2022, ICM 2022, Helsinki, Finland, virtual, July 6–14, 2022. Volume 6. Sections 12–14. Berlin: European Mathematical Society (EMS). 4914-4969 (2023).
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture. (English) Zbl 1520.68041
No-signaling linear PCPs. (English) Zbl 07674049
PCPs and instance compression from a cryptographic Lens. (English) Zbl 07829262
Braverman, Mark (ed.), 13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 – February 3, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 215, Article 30, 19 p. (2022).
MSC:
68Qxx
Dequantizing the quantum singular value transformation: hardness and applications to quantum chemistry and the quantum PCP conjecture. (English) Zbl 07774317
Leonardi, Stefano (ed.) et al., Proceedings of the 54th annual ACM SIGACT symposium on theory of computing, STOC ’22, Rome, Italy June 20–24, 2022. New York, NY: Association for Computing Machinery (ACM). 19-32 (2022).
MSC:
68Qxx
An improved graph Laplacian regularization method for identifying biomarkers of Alzheimer’s disease. (English) Zbl 1489.92040
Exact solutions to a nonlinear partial differential equation: the Product-of-Curvatures Poisson \((u_{x x} u_{y y} = 1)\). (English) Zbl 1505.35173
Optimal tiling of the Euclidean space using permutation-symmetric bodies. (English) Zbl 07711587
Kabanets, Valentine (ed.), 36th computational complexity conference, CCC 2021, Toronto, Ontario, Canada, virtual conference, July 20–23, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 200, Article 5, 48 p. (2021).
MSC:
68Q25
Promise constraint satisfaction: algebraic structure and a symmetric Boolean dichotomy. (English) Zbl 1494.68094
Revisiting alphabet reduction in Dinur’s PCP. (English) Zbl 07758336
Byrka, Jarosław (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 23rd international conference, APPROX 2020, and 24th international conference, RANDOM 2020, August 17–19, 2020, Virtual conference. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 176, Article 34, 14 p. (2020).
Improved 3LIN hardness via linear label cover. (English) Zbl 07650076
Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 9, 16 p. (2019).
Imperfect gaps in gap-ETH and PCPs. (English) Zbl 07564432
Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 32, 19 p. (2019).
MSC:
68Q25
Stronger connections between circuit analysis and circuit lower bounds, via PCPs of proximity. (English) Zbl 07564419
Shpilka, Amir (ed.), 34th computational complexity conference, CCC 2019, New Brunswick, NJ, USA, July 18–20, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 137, Article 19, 43 p. (2019).
MSC:
68Q25
Hamiltonian sparsification and gap-simulation. (English) Zbl 1542.68062
Blum, Avrim (ed.), 10th innovations in theoretical computer science conference, ITCS 2019, January 10–12, 2019, San Diego, CA, USA. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 124, Article 2, 21 p. (2019).
Scalable zero knowledge with no trusted setup. (English) Zbl 1509.94063
Boldyreva, Alexandra (ed.) et al., Advances in cryptology – CRYPTO 2019. 39th annual international cryptology conference, Santa Barbara, CA, USA, August 18–22, 2019. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 11694, 701-732 (2019).
MSC:
94A60
Towards a general direct product testing theorem. (English) Zbl 1528.68405
Ganguly, Sumit (ed.) et al., 38th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2018, Ahmedabad, India, December 11–13, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 122, Article 11, 17 p. (2018).
Fast and deterministic constant factor approximation algorithms for LCS imply new circuit lower bounds. (English) Zbl 1462.68239
Karlin, Anna R. (ed.), 9th innovations in theoretical computer science conference, ITCS 2018, Cambridge, MA, USA, January 11–14, 2018. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 94, Article 35, 14 p. (2018).
Hardness of rainbow coloring hypergraphs. (English) Zbl 1491.68144
Lokam, Satya (ed.) et al., 37th IARCS annual conference on foundations of software technology and theoretical computer science, FSTTCS 2017, IIT Kanpur, India, December 12–14, 2017. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 93, Article 33, 15 p. (2018).
Hardness of approximate nearest neighbor search. (English) Zbl 1428.68167
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). 1260-1268 (2018).
On non-optimally expanding sets in Grassmann graphs. (English) Zbl 1429.68077
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). 940-951 (2018).
Towards a proof of the 2-to-1 games conjecture? (English) Zbl 1429.68076
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). 376-389 (2018).
No-signaling linear PCPs. (English) Zbl 1443.94068
Beimel, Amos (ed.) et al., Theory of cryptography. 16th international conference, TCC 2018, Panaji, India, November 11–14, 2018. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 11239, 67-97 (2018).
MSC:
94A60
On fixed points of rational transductions. (English) Zbl 1412.03019
Reviewer: Saeed Salehi (Tabriz)
A quantum linearity test for robustly verifying entanglement. (English) Zbl 1370.81045
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). 1003-1015 (2017).
On independent sets, 2-to-2 games, and Grassmann graphs. (English) Zbl 1370.68130
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). 576-589 (2017).
Compression of quantum multi-prover interactive proofs. (English) Zbl 1370.68102
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). 289-302 (2017).
Hardness of coloring 2-colorable 12-uniform hypergraphs with \(2^{(\log n)^{\Omega(1)}}\) colors. (English) Zbl 1359.68109
Pointer quantum PCPs and multi-prover games. (English) Zbl 1398.68174
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 21, 14 p. (2016).
Hardness of bipartite expansion. (English) Zbl 1397.68101
Sankowski, Piotr (ed.) et al., 24th annual European symposium on algorithms, ESA 2016, Aarhus, Denmark, August 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-015-6). LIPIcs – Leibniz International Proceedings in Informatics 57, Article 55, 17 p. (2016).
Three-player entangled XOR games are NP-hard to approximate. (English) Zbl 1342.81080
SIAM J. Comput. 45, No. 3, 1007-1063 (2016); erratum ibid. 49, No. 6, 1423-1427 (2020).
Can almost everybody be almost happy? (English) Zbl 1335.91021
Proceedings of the 7th ACM conference on innovations in theoretical computer science, ITCS’16, Cambridge, MA, USA, January 14–16, 2016. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-4057-1). 1-9 (2016).
Making the best of a leaky situation: zero-knowledge PCPs from leakage-resilient circuits. (English) Zbl 1375.94136
Kushilevitz, Eyal (ed.) et al., Theory of cryptography. 13th international conference, TCC 2016-A, Tel Aviv, Israel, January 10–13, 2016. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-49098-3/pbk; 978-3-662-49099-0/ebook). Lecture Notes in Computer Science 9563, 3-32 (2016).
Combinatorial PCPs with short proofs. (English) Zbl 1336.68090
MSC:
68Q15
Input-oblivious proof systems and a uniform complexity perspective on P/poly. (English) Zbl 1347.68160
Inapproximability of minimum vertex cover on \(k\)-uniform \(k\)-partite hypergraphs. (English) Zbl 1331.68089
Executable proofs, input-size hiding secure computation and a new ideal world. (English) Zbl 1403.94047
Oswald, Elisabeth (ed.) et al., Advances in cryptology – EUROCRYPT 2015. 34th annual international conference on the theory and applications of cryptographic techniques, Sofia, Bulgaria, April 26–30, 2015. Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-46802-9/pbk; 978-3-662-46803-6/ebook). Lecture Notes in Computer Science 9057, 532-560 (2015).
An improved lower bound for approximating the minimum integral solution problem with preprocessing over \(\ell_\infty\) norm. (English) Zbl 1331.90064
The projection games conjecture and the NP-hardness of \(\ln n\)-approximating Set-Cover. (English) Zbl 1335.68097
On the NP-hardness of approximating ordering-constraint satisfaction problems. (English) Zbl 1335.68094
MSC:
68Q17
The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\). (English) Zbl 1327.68105
Verifiable computation in multiparty protocols with honest majority. (English) Zbl 1368.94109
Chow, Sherman S.M. (ed.) et al., Provable security. 8th international conference, ProvSec 2014, Hong Kong, China, October 9–10, 2014. Proceedings. Berlin: Springer (ISBN 978-3-319-12474-2/pbk). Lecture Notes in Computer Science 8782, 146-161 (2014).
Combinatorial PCPs with efficient verifiers. (English) Zbl 1318.68087
MSC:
68Q15
Towards an optimal query efficient PCP? (English) Zbl 1361.68099
Proceedings of the 4th conference on innovations in theoretical computer science, ITCS’13, Berkeley, CA, USA, January 9–12, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1859-4). 173-186 (2013).
The PCP theorem for NP over the reals. (English) Zbl 1354.68092
Portier, Natacha (ed.) et al., 30th international symposium on theoretical aspects of computer science, STACS’ 13, Kiel, Germany, February 27 – March 2, 2013. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-50-7). LIPIcs – Leibniz International Proceedings in Informatics 20, 104-115 (2013).
Product-state approximations to quantum ground states. (English) Zbl 1293.68127
Proceedings of the 45th annual ACM symposium on theory of computing, STOC ’13. Palo Alto, CA, USA, June 1–4, 2013. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-2029-0). 871-880 (2013).
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes. (English) Zbl 1300.94080
Sako, Kazue (ed.) et al., Advances in cryptology – ASIACRYPT 2013. 19th international conference on the theory and application of cryptology and information security, Bengaluru, India, December 1–5, 2013. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-42032-0/pbk). Lecture Notes in Computer Science 8269, 41-60 (2013).
\(\mathcal{NP}\)-hardness of approximately solving linear equations over reals. (English) Zbl 1272.68144
MSC:
68Q17
Inapproximability results for the minimum integral solution problem with preprocessing over \(\ell_{\infty}\) norm. (English) Zbl 1281.68121
MSC:
68Q17
On the approximation ratio threshold for the reoptimization of the maximum number of satisfied equations in linear systems over a finite field. (English. Russian original) Zbl 1298.68102
Cybern. Syst. Anal. 48, No. 3, 335-348 (2012); translation from Kibern. Sist. Anal. 2012, No. 3, 18-34 (2012).
\(2^{\log^{1-\varepsilon} n}\) hardness for the closest vector problem with preprocessing. (English) Zbl 1286.68199
Karloff, Howard J. (ed.) et al., Proceedings of the 44th annual ACM symposium on theory of computing, STOC 2012. New York, NY, USA, May 19–22, 2012. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-1245-5). 277-288 (2012).
MSC:
68Q17
Reoptimization of constraint satisfaction problems with approximation resistant predicates. (English. Russian original) Zbl 1290.90074
Cybern. Syst. Anal. 48, No. 1, 73-85 (2012); translation from Kibern. Sist. Anal. 2012, No. 1, 89-104 (2012).
Reviewer: Nada Djuranović-Miličić (Belgrade)
MSC:
90C30
Securing circuits against constant-rate tampering. (English) Zbl 1296.94103
Safavi-Naini, Reihaneh (ed.) et al., Advances in cryptology – CRYPTO 2012. 32nd annual cryptology conference, Santa Barbara, CA, USA, August 19–23, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-32008-8/pbk). Lecture Notes in Computer Science 7417, 533-551 (2012).
MSC:
94A60
94C10
Undecidability of infinite Post correspondence problem for instances of size 8. (English) Zbl 1257.03069
NP-hardness of approximately solving linear equations over reals. (English) Zbl 1288.68271
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). 413-420 (2011).
PCP characterizations of NP: toward a polynomially-small error-probability. (English) Zbl 1234.68133
Probabilistically checkable proofs and codes. (English) Zbl 1252.68139
Bhatia, Rajendra (ed.) et al., Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19–27, 2010. Vol. I: Plenary lectures and ceremonies. Hackensack, NJ: World Scientific; New Delhi: Hindustan Book Agency (ISBN 978-981-4324-30-4/set; 978-81-85931-08-3/hbk; 978-981-4324-31-1/hbk; 978-981-4324-35-9/ebook). 265-285 (2011).
Bravely, moderately: a common theme in four recent works. (English) Zbl 1343.68113
Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 373-389 (2011).
Using the FGLSS-reduction to prove inapproximability results for minimum vertex cover in hypergraphs. (English) Zbl 1343.68094
Goldreich, Oded (ed.), Studies in complexity and cryptography. Miscellanea on the interplay between randomness and computation. In collaboration with Lidor Avigad, Mihir Bellare, Zvika Brakerski, Shafi Goldwasser, Shai Halevi, Tali Kaufman, Leonid Levin, Noam Nisan, Dana Ron, Madhu Sudan, Luca Trevisan, Salil Vadhan, Avi Wigderson, David Zuckerman. Berlin: Springer (ISBN 978-3-642-22669-4/pbk). Lecture Notes in Computer Science 6650, 88-97 (2011).
Sub-constant error probabilistically checkable proof of almost-linear size. (English) Zbl 1213.68317
Post correspondence problem with partially commutative alphabets. (English) Zbl 1284.68355
Dediu, Adrian-Horia (ed.) et al., Language and automata theory and applications. 4th international conference, LATA 2010, Trier, Germany, May 24–28, 2010. Proceedings. Berlin: Springer (ISBN 978-3-642-13088-5/pbk). Lecture Notes in Computer Science 6031, 356-367 (2010).
MSC:
68Q45
e-PCP: a robust skew detection method for scanned document images. (English) Zbl 1185.68591
MSC:
68T10
Sound 3-query PCPPs are long. (English) Zbl 1322.68094
MSC:
68Q25
68T15
Conditional hardness for satisfiable 3-CSPs. (English) Zbl 1304.68080
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). 493-502 (2009).
The detectability lemma and quantum gap amplification. (English) Zbl 1304.68049
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). 417-426 (2009).
New direct-product testers and \(2\)-query PCPs. (English) Zbl 1304.68048
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). 131-140 (2009).
The power of unentanglement. (English) Zbl 1213.68280
A hypergraph dictatorship test with perfect completeness. (English) Zbl 1255.68147
Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 448-461 (2009).
NP-completeness of (\(k\)-SAT, \(r\)-UN\(k\)-SAT) and (LSAT\(_{ \geq k }\), \(r\)-UNLSAT\(_{ \geq k }\)). (English) Zbl 1143.68403
Preparata, Franco P. (ed.) et al., Frontiers in algorithmics. Second annual international workshop, FAW 2008, Changsha, China, June 19–21, 2008. Proceeedings. Berlin: Springer (ISBN 978-3-540-69310-9/pbk). Lecture Notes in Computer Science 5059, 79-88 (2008).
Intricacies of simple word equations: an example. (English) Zbl 1183.68440
MSC:
68R15
A note on the emptiness of semigroup intersections. (English) Zbl 1128.03034
Reviewer: Daniela Marinescu (Braşov)
The PCP theorem by gap amplification. (English) Zbl 1301.68133
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). 241-250 (2006).
Filter Results by …
Document Type
- Journal Articles (67)
- Collection Articles (51)
all
top 5
Author
- Khot, Subhash Ajit (12)
- Safra, Muli (10)
- Dinur, Irit (9)
- Guruswami, Venkatesan (6)
- Moshkovitz, Dana (6)
- Goldreich, Oded (5)
- Aharonov, Dorit (4)
- Harsha, Prahladh (4)
- Meer, Klaus (4)
- Meir, Or (4)
- Minzer, Dor (4)
- Saket, Rishi (4)
- Baartse, Martijn (3)
- Ben-Sasson, Eli (3)
- Håstad, Johan Torkel (3)
- Kindler, Guy (3)
- Raz, Ran (3)
- Rubinstein, Aviad (3)
- Arad, Itai (2)
- Arora, Sanjeev (2)
- Ben-Ameur, Walid (2)
- Chen, Lijie (2)
- Eldar, Lior (2)
- Fischer, Eldar (2)
- Gharibian, Sevag (2)
- Goldenberg, Elazar (2)
- James, Robert C. (2)
- Khanna, Sanjeev (2)
- Kiyoshima, Susumu (2)
- Le Gall, François (2)
- Li, Fufang (2)
- Mikhailyuk, Victor A. (2)
- Peng, Lingxi (2)
- Sudan, Madhu (2)
- Tang, Maobin (2)
- Vidick, Thomas (2)
- Wang, Jianxiong (2)
- Wang, Songtao (2)
- Wigderson, Avi (2)
- Xiong, Wei (2)
- Aaronson, Scott (1)
- Abboud, Amir (1)
- Aftab, Wasim (1)
- Al-Najjar, Yacine (1)
- Alman, Josh (1)
- Anshu, Anurag (1)
- Argyros, Spiros A. (1)
- Austrin, Per (1)
- Babichenko, Yakov (1)
- Bafna, Mitali (1)
- Băleanu, Dumitru I. (1)
- Bansal, Nikhil (1)
- Beigi, Salman (1)
- Bell, Paul C. (1)
- Bentov, Iddo (1)
- Brakensiek, Joshua (1)
- Brandão, Fernando G. S. L. (1)
- Braverman, Mark (1)
- Breuckmann, Nikolas P. (1)
- Bronfman, Liron (1)
- Cao, Xiangyong (1)
- Chalermsook, Parinya (1)
- Chase, Melissa (1)
- Chen, Victor C. (1)
- Chen, Wenbin (1)
- Chen, Wenbin (1)
- Çivril, Ali (1)
- Czeizler, Elena (1)
- Dachman-Soled, Dana (1)
- Deliyanni, Irene (1)
- Deng, Tianyan (1)
- Dey, Prasenjit (1)
- Dong, Jing (1)
- Drucker, Andrew (1)
- Fefferman, Bill (1)
- Fortnow, Lance J. (1)
- Glasby, Stephen Peter (1)
- Golchin, Akbar (1)
- Goldwasser, Shafi (1)
- Grilo, Alex Bredariol (1)
- Gu, Jason J. (1)
- Gutman, Ivan M. (1)
- Halava, Vesa (1)
- Hare, David E. G. (1)
- Harju, Tero (1)
- Harrow, Aram Wettroth (1)
- Holub, Štěpán (1)
- Horesh, Yinon (1)
- Huh, Myung-Hoe (1)
- Impagliazzo, Russell (1)
- Ishai, Yuval (1)
- Jendrej, Jacek (1)
- Jeronimo, Fernando Granha (1)
- Ji, Zhengfeng (1)
- Jia, Xixi (1)
- Jiménez-Sevilla, Mar (1)
- Kabanets, Valentine (1)
- Karhumaki, Juhani (1)
- Karthik, C. S. (1)
- Kerenidis, Iordanis (1)
- and 78 more Authors
all
top 5
Serial
- SIAM J. Comput. (12)
- Theory Comput. (7)
- Comput. Complexity (6)
- Theor. Comput. Sci. (3)
- ACM Trans. Comput. Theory (3)
- SIAM J. Discrete Math. (2)
- Cybern. Syst. Anal. (2)
- Discrete Appl. Math. (1)
- Inf. Process. Lett. (1)
- Isr. J. Math. (1)
- J. Math. Anal. Appl. (1)
- Rocky Mt. J. Math. (1)
- Collect. Math. (1)
- Czech. Math. J. (1)
- J. Comput. Appl. Math. (1)
- J. Comput. Syst. Sci. (1)
- Proc. Am. Math. Soc. (1)
- Combinatorica (1)
- J. Symb. Comput. (1)
- J. Complexity (1)
- Algorithmica (1)
- J. Cryptology (1)
- Random Struct. Algorithms (1)
- Int. J. Found. Comput. Sci. (1)
- Pattern Recognition (1)
- J. Math. Chem. (1)
- Math. Probl. Eng. (1)
- J. Comb. Optim. (1)
- J. ACM (1)
- Fundam. Inform. (1)
- Found. Comput. Math. (1)
- Quantum Inf. Process. (1)
- J. Korean Stat. Soc. (1)
- SIAM J. Imaging Sci. (1)
- Quantum Inf. Comput. (1)
- J. Control Sci. Eng. (1)
- RAIRO, Theor. Inform. Appl. (1)
- J. Theor. Biol. (1)
- Pure Appl. Funct. Anal. (1)
