Landsberg, J. M. Algebraic geometry and representation theory in the study of matrix multiplication complexity and other problems in theoretical computer science. (English) Zbl 07538403 Differ. Geom. Appl. 82, Article ID 101888, 23 p. (2022). MSC: 14L30 68Q15 68Q17 15A69 14L35 13F20 PDF BibTeX XML Cite \textit{J. M. Landsberg}, Differ. Geom. Appl. 82, Article ID 101888, 23 p. (2022; Zbl 07538403) Full Text: DOI OpenURL
Böhm, Martin; Hoeksma, Ruben; Megow, Nicole; Nölke, Lukas; Simon, Bertrand On hop-constrained Steiner trees in tree-like metrics. (English) Zbl 07537556 SIAM J. Discrete Math. 36, No. 2, 1249-1273 (2022). MSC: 68Q25 90C27 05C12 PDF BibTeX XML Cite \textit{M. Böhm} et al., SIAM J. Discrete Math. 36, No. 2, 1249--1273 (2022; Zbl 07537556) Full Text: DOI OpenURL
Chen, Lijie; Ren, Hanlin Strong average-case circuit lower bounds from nontrivial derandomization. (English) Zbl 07534654 SIAM J. Comput. 51, No. 3, STOC20-115-STOC20-173 (2022). MSC: 68Q05 68Q17 PDF BibTeX XML Cite \textit{L. Chen} and \textit{H. Ren}, SIAM J. Comput. 51, No. 3, STOC20--115-STOC20--173 (2022; Zbl 07534654) Full Text: DOI OpenURL
Bitansky, Nir; Chiesa, Alessandro; Ishai, Yuval; Ostrovsky, Rafail; Paneth, Omer Succinct non-interactive arguments via linear interactive proofs. (English) Zbl 07524287 J. Cryptology 35, No. 3, Paper No. 15, 72 p. (2022). MSC: 94A60 94A62 68Q25 PDF BibTeX XML Cite \textit{N. Bitansky} et al., J. Cryptology 35, No. 3, Paper No. 15, 72 p. (2022; Zbl 07524287) Full Text: DOI OpenURL
Stanković, Aleksa On regularity of Max-CSPs and Min-CSPs. (English) Zbl 1484.68332 Inf. Process. Lett. 176, Article ID 106244, 17 p. (2022). MSC: 68W25 68R07 PDF BibTeX XML Cite \textit{A. Stanković}, Inf. Process. Lett. 176, Article ID 106244, 17 p. (2022; Zbl 1484.68332) Full Text: DOI OpenURL
Mukhopadhyay, Priyanka The projection games conjecture and the hardness of approximation of Super-SAT and related problems. (English) Zbl 1472.68064 J. Comput. Syst. Sci. 123, 186-201 (2022). MSC: 68Q17 68R05 68R07 PDF BibTeX XML Cite \textit{P. Mukhopadhyay}, J. Comput. Syst. Sci. 123, 186--201 (2022; Zbl 1472.68064) Full Text: DOI arXiv OpenURL
Chiesa, Alessandro; Yogev, Eylon Subquadratic SNARGs in the random oracle model. (English) Zbl 1485.94073 Malkin, Tal (ed.) et al., Advances in cryptology – CRYPTO 2021. 41st annual international cryptology conference, CRYPTO 2021, virtual event, August 16–20, 2021. Proceedings. Part I. Cham: Springer. Lect. Notes Comput. Sci. 12825, 711-741 (2021). MSC: 94A60 PDF BibTeX XML Cite \textit{A. Chiesa} and \textit{E. Yogev}, Lect. Notes Comput. Sci. 12825, 711--741 (2021; Zbl 1485.94073) Full Text: DOI OpenURL
Meer, Klaus A PCP of proximity for real algebraic polynomials. (English) Zbl 07493536 Santhanam, Rahul (ed.) et al., Computer science – theory and applications. 16th international computer science symposium in Russia, CSR 2021, Sochi, Russia, June 28 – July 2, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12730, 264-282 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{K. Meer}, Lect. Notes Comput. Sci. 12730, 264--282 (2021; Zbl 07493536) Full Text: DOI OpenURL
Paradise, Orr Smooth and strong PCPs. (English) Zbl 1485.68101 Comput. Complexity 30, No. 1, Paper No. 1, 77 p. (2021); corrigendum ibid. 30, No. 1, Paper No. 9, 1 p. (2021). Reviewer: Arne Meier (Hannover) MSC: 68Q15 68Q10 68Q17 68W20 PDF BibTeX XML Cite \textit{O. Paradise}, Comput. Complexity 30, No. 1, Paper No. 1, 77 p. (2021; Zbl 1485.68101) Full Text: DOI OpenURL
Fu, Yuxi Model independent approach to probabilistic models. (English) Zbl 07346945 Theor. Comput. Sci. 869, 181-194 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{Y. Fu}, Theor. Comput. Sci. 869, 181--194 (2021; Zbl 07346945) Full Text: DOI OpenURL
Briët, Jop; Labib, Farrokh High-entropy dual functions over finite fields and locally decodable codes. (English) Zbl 07319055 Forum Math. Sigma 9, Paper No. e19, 10 p. (2021). MSC: 11B30 11B25 PDF BibTeX XML Cite \textit{J. Briët} and \textit{F. Labib}, Forum Math. Sigma 9, Paper No. e19, 10 p. (2021; Zbl 07319055) Full Text: DOI arXiv OpenURL
van Ee, Martijn; Sitters, René The Chinese deliveryman problem. (English) Zbl 1468.90116 4OR 18, No. 3, 341-356 (2020). MSC: 90C27 68Q17 90C59 PDF BibTeX XML Cite \textit{M. van Ee} and \textit{R. Sitters}, 4OR 18, No. 3, 341--356 (2020; Zbl 1468.90116) Full Text: DOI OpenURL
Chuzhoy, Julia; Kim, David H. K.; Nimavat, Rachit New hardness results for routing on disjoint paths. (English) Zbl 07294218 SIAM J. Comput. 49, No. 6, STOC17-189-STOC17-237 (2020). MSC: 68Q25 68W25 PDF BibTeX XML Cite \textit{J. Chuzhoy} et al., SIAM J. Comput. 49, No. 6, STOC17--189-STOC17--237 (2020; Zbl 07294218) Full Text: DOI arXiv OpenURL
Chalermsook, Parinya; Cygan, Marek; Kortsarz, Guy; Laekhanukit, Bundit; Manurangsi, Pasin; Nanongkai, Danupon; Trevisan, Luca From gap-exponential time hypothesis to fixed parameter tractable inapproximability: clique, dominating set, and more. (English) Zbl 1452.68083 SIAM J. Comput. 49, No. 4, 772-810 (2020). MSC: 68Q17 05C69 68Q27 68R10 68W25 68W40 PDF BibTeX XML Cite \textit{P. Chalermsook} et al., SIAM J. Comput. 49, No. 4, 772--810 (2020; Zbl 1452.68083) Full Text: DOI OpenURL
Arunachaleswaran, Eshwar Ram; Barman, Siddharth; Kumar, Rachitesh; Rathi, Nidhi Fair and efficient cake division with connected pieces. (English) Zbl 1435.91103 Caragiannis, Ioannis (ed.) et al., Web and Internet economics. 15th international conference, WINE 2019, New York, NY, USA, December 10–12, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11920, 57-70 (2019). MSC: 91B32 68Q17 68W25 91B15 PDF BibTeX XML Cite \textit{E. R. Arunachaleswaran} et al., Lect. Notes Comput. Sci. 11920, 57--70 (2019; Zbl 1435.91103) Full Text: DOI arXiv OpenURL
Han, Yo-Sub; Ko, Sang-Ki Alignment distance of regular tree languages. (English) Zbl 1430.68146 Theor. Comput. Sci. 787, 127-137 (2019). MSC: 68Q45 68P05 68W40 PDF BibTeX XML Cite \textit{Y.-S. Han} and \textit{S.-K. Ko}, Theor. Comput. Sci. 787, 127--137 (2019; Zbl 1430.68146) Full Text: DOI OpenURL
Chen, Yijia; Lin, Bingkai The constant inapproximability of the parameterized dominating set problem. (English) Zbl 1422.68082 SIAM J. Comput. 48, No. 2, 513-533 (2019). MSC: 68Q17 05C69 68Q25 68R10 PDF BibTeX XML Cite \textit{Y. Chen} and \textit{B. Lin}, SIAM J. Comput. 48, No. 2, 513--533 (2019; Zbl 1422.68082) Full Text: DOI arXiv OpenURL
Abu-Affash, A. Karim; Bhore, Sujoy; Carmi, Paz; Chakraborty, Dibyayan Bottleneck bichromatic full Steiner trees. (English) Zbl 1469.68144 Inf. Process. Lett. 142, 14-19 (2019). MSC: 68U05 68Q17 68R10 68W25 68W40 90C59 PDF BibTeX XML Cite \textit{A. K. Abu-Affash} et al., Inf. Process. Lett. 142, 14--19 (2019; Zbl 1469.68144) Full Text: DOI OpenURL
Atserias, Albert; Dawar, Anuj Definable inapproximability: new challenges for duplicator. (English) Zbl 07533332 Ghica, Dan R. (ed.) et al., 27th EACSL annual conference on computer science logic, CSL 2018, Birmingham, United Kingdom, September 4–8, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 119, Article 7, 21 p. (2018). MSC: 03B70 PDF BibTeX XML Cite \textit{A. Atserias} and \textit{A. Dawar}, LIPIcs -- Leibniz Int. Proc. Inform. 119, Article 7, 21 p. (2018; Zbl 07533332) Full Text: DOI OpenURL
Viderman, Michael Explicit strong LTCs with inverse poly-log rate and constant soundness. (English) Zbl 07378670 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 58, 14 p. (2018). MSC: 68W20 68W25 90C27 PDF BibTeX XML Cite \textit{M. Viderman}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 58, 14 p. (2018; Zbl 07378670) Full Text: DOI OpenURL
Manurangsi, Pasin; Trevisan, Luca Mildly exponential time approximation algorithms for vertex cover, balanced separator and uniform sparsest cut. (English) Zbl 07378632 Blais, Eric (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 21st international workshop, APPROX 2018, and 22nd international workshop, RANDOM 2018 August 20–22, 2018, Princeton, USA. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 116, Article 20, 17 p. (2018). MSC: 68W20 68W25 90C27 PDF BibTeX XML Cite \textit{P. Manurangsi} and \textit{L. Trevisan}, LIPIcs -- Leibniz Int. Proc. Inform. 116, Article 20, 17 p. (2018; Zbl 07378632) Full Text: DOI OpenURL
Dinur, Irit; Manurangsi, Pasin ETH-hardness of approximating 2-CSPs and directed Steiner network. (English) Zbl 1462.68068 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 36, 20 p. (2018). MSC: 68Q17 68Q27 68R10 68W25 PDF BibTeX XML Cite \textit{I. Dinur} and \textit{P. Manurangsi}, LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 36, 20 p. (2018; Zbl 1462.68068) Full Text: DOI arXiv OpenURL
Gur, Tom; Ramnarayan, Govind; Rothblum, Ron D. Relaxed locally correctable codes. (English) Zbl 1462.68050 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 27, 11 p. (2018). MSC: 68Q10 68P30 PDF BibTeX XML Cite \textit{T. Gur} et al., LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 27, 11 p. (2018; Zbl 1462.68050) Full Text: DOI OpenURL
Srinivasan, Srikanth; Sudan, Madhu Local decoding and testing of polynomials over grids. (English) Zbl 1462.68052 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 26, 14 p. (2018). MSC: 68Q10 68P30 68W20 94B35 PDF BibTeX XML Cite \textit{S. Srinivasan} and \textit{M. Sudan}, LIPIcs -- Leibniz Int. Proc. Inform. 94, Article 26, 14 p. (2018; Zbl 1462.68052) Full Text: DOI OpenURL
Guruswami, Venkatesan; Saket, Rishi Hardness of rainbow coloring hypergraphs. (English) Zbl 07278105 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). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{V. Guruswami} and \textit{R. Saket}, LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 33, 15 p. (2018; Zbl 07278105) Full Text: DOI OpenURL
Bhangale, Amey; Khot, Subhash; Thiruvenkatachari, Devanathan An improved dictatorship test with perfect completeness. (English) Zbl 07278087 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 15, 23 p. (2018). MSC: 68N30 68Qxx PDF BibTeX XML Cite \textit{A. Bhangale} et al., LIPIcs -- Leibniz Int. Proc. Inform. 93, Article 15, 23 p. (2018; Zbl 07278087) Full Text: DOI arXiv OpenURL
Paschos, Vangelis Th. When polynomial approximation meets exact computation. (English) Zbl 1434.68202 Ann. Oper. Res. 271, No. 1, 87-103 (2018). MSC: 68Q25 05C85 68W25 PDF BibTeX XML Cite \textit{V. Th. Paschos}, Ann. Oper. Res. 271, No. 1, 87--103 (2018; Zbl 1434.68202) Full Text: DOI OpenURL
Kiyoshima, Susumu 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 PDF BibTeX XML Cite \textit{S. Kiyoshima}, Lect. Notes Comput. Sci. 11239, 67--97 (2018; Zbl 1443.94068) Full Text: DOI OpenURL
Ding, Wei; Qiu, Ke A quadratic time exact algorithm for continuous connected 2-facility location problem in trees. (English) Zbl 1412.90130 J. Comb. Optim. 36, No. 4, 1262-1298 (2018). MSC: 90C27 90C35 PDF BibTeX XML Cite \textit{W. Ding} and \textit{K. Qiu}, J. Comb. Optim. 36, No. 4, 1262--1298 (2018; Zbl 1412.90130) Full Text: DOI OpenURL
Adamaszek, Anna; Chalermsook, Parinya; Ene, Alina; Wiese, Andreas Submodular unsplittable flow on trees. (English) Zbl 1411.90285 Math. Program. 172, No. 1-2 (B), 565-589 (2018). MSC: 90C27 90C35 68W25 PDF BibTeX XML Cite \textit{A. Adamaszek} et al., Math. Program. 172, No. 1--2 (B), 565--589 (2018; Zbl 1411.90285) Full Text: DOI OpenURL
Chandrasekaran, Karthekeyan; Cheraghchi, Mahdi; Gandikota, Venkata; Grigorescu, Elena Local testing of lattices. (English) Zbl 1422.11147 SIAM J. Discrete Math. 32, No. 2, 1265-1295 (2018). MSC: 11H31 94B05 PDF BibTeX XML Cite \textit{K. Chandrasekaran} et al., SIAM J. Discrete Math. 32, No. 2, 1265--1295 (2018; Zbl 1422.11147) Full Text: DOI OpenURL
Bonnet, Édouard; Paschos, Vangelis Th. Sparsification and subexponential approximation. (English) Zbl 1408.68068 Acta Inf. 55, No. 1, 1-15 (2018). Reviewer: Sevag Gharibian (Paderborn) MSC: 68Q17 68W25 PDF BibTeX XML Cite \textit{É. Bonnet} and \textit{V. Th. Paschos}, Acta Inf. 55, No. 1, 1--15 (2018; Zbl 1408.68068) Full Text: DOI arXiv Link OpenURL
Applebaum, Benny; Lovett, Shachar Algebraic attacks against random local functions and their countermeasures. (English) Zbl 1417.94039 SIAM J. Comput. 47, No. 1, 52-79 (2018). MSC: 94A60 PDF BibTeX XML Cite \textit{B. Applebaum} and \textit{S. Lovett}, SIAM J. Comput. 47, No. 1, 52--79 (2018; Zbl 1417.94039) Full Text: DOI OpenURL
Manurangsi, Pasin Inapproximability of maximum biclique problems, minimum \( k\)-cut and densest at-least-\( k\)-subgraph from the small set expansion hypothesis. (English) Zbl 1461.68160 Algorithms (Basel) 11, No. 1, Paper No. 10, 22 p. (2017). MSC: 68R10 68Q17 PDF BibTeX XML Cite \textit{P. Manurangsi}, Algorithms (Basel) 11, No. 1, Paper No. 10, 22 p. (2017; Zbl 1461.68160) Full Text: DOI arXiv OpenURL
Briët, Jop; Dvir, Zeev; Gopi, Sivakanth Outlaw distributions and locally decodable codes. (English) Zbl 1402.94121 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 20, 19 p. (2017). MSC: 94B35 68Q17 68Q87 PDF BibTeX XML Cite \textit{J. Briët} et al., LIPIcs -- Leibniz Int. Proc. Inform. 67, Article 20, 19 p. (2017; Zbl 1402.94121) Full Text: DOI arXiv OpenURL
Bitansky, Nir; Canetti, Ran; Chiesa, Alessandro; Goldwasser, Shafi; Lin, Huijia; Rubinstein, Aviad; Tromer, Eran The hunting of the SNARK. (English) Zbl 1386.94066 J. Cryptology 30, No. 4, 989-1066 (2017). MSC: 94A60 68Q05 68Q10 PDF BibTeX XML Cite \textit{N. Bitansky} et al., J. Cryptology 30, No. 4, 989--1066 (2017; Zbl 1386.94066) Full Text: DOI OpenURL
Fischer, Anja; Hungerländer, Philipp The traveling salesman problem on grids with forbidden neighborhoods. (English) Zbl 1383.90029 J. Comb. Optim. 34, No. 3, 891-915 (2017). MSC: 90C27 05C38 PDF BibTeX XML Cite \textit{A. Fischer} and \textit{P. Hungerländer}, J. Comb. Optim. 34, No. 3, 891--915 (2017; Zbl 1383.90029) Full Text: DOI OpenURL
Moshkovitz, Dana Low-degree test with polynomially small error. (English) Zbl 1378.68052 Comput. Complexity 26, No. 3, 531-582 (2017). MSC: 68Q17 68Q25 68W20 PDF BibTeX XML Cite \textit{D. Moshkovitz}, Comput. Complexity 26, No. 3, 531--582 (2017; Zbl 1378.68052) Full Text: DOI OpenURL
Austrin, Per; Guruswami, Venkatesan; Håstad, Johan \((2+\varepsilon)\)-Sat is NP-hard. (English) Zbl 1476.68188 SIAM J. Comput. 46, No. 5, 1554-1573 (2017). MSC: 68R07 05C15 05C65 68Q17 68R10 PDF BibTeX XML Cite \textit{P. Austrin} et al., SIAM J. Comput. 46, No. 5, 1554--1573 (2017; Zbl 1476.68188) Full Text: DOI OpenURL
Han, Yo-Sub; Ko, Sang-Ki Alignment distance of regular tree languages. (English) Zbl 1429.68115 Carayol, Arnaud (ed.) et al., Implementation and application of automata. 22nd international conference, CIAA 2017, Marne-la-Vallée, France, June 27–30, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10329, 126-137 (2017). MSC: 68Q45 PDF BibTeX XML Cite \textit{Y.-S. Han} and \textit{S.-K. Ko}, Lect. Notes Comput. Sci. 10329, 126--137 (2017; Zbl 1429.68115) Full Text: DOI OpenURL
David, Roee; Dinur, Irit; Goldenberg, Elazar; Kindler, Guy; Shinkar, Igor Direct sum testing. (English) Zbl 1371.68322 SIAM J. Comput. 46, No. 4, 1336-1369 (2017). MSC: 68W20 68Q25 PDF BibTeX XML Cite \textit{R. David} et al., SIAM J. Comput. 46, No. 4, 1336--1369 (2017; Zbl 1371.68322) Full Text: DOI OpenURL
Ben-Sasson, Eli; Bentov, Iddo; Chiesa, Alessandro; Gabizon, Ariel; Genkin, Daniel; Hamilis, Matan; Pergament, Evgenya; Riabzev, Michael; Silberstein, Mark; Tromer, Eran; Virza, Madars Computational integrity with a public random string from quasi-linear PCPs. (English) Zbl 1415.94409 Coron, Jean-Sébastien (ed.) et al., Advances in cryptology – EUROCRYPT 2017. 36th annual international conference on the theory and applications of cryptographic techniques, Paris, France, April 30 – May 4, 2017. Proceedings. Part III. Cham: Springer. Lect. Notes Comput. Sci. 10212, 551-579 (2017). MSC: 94A60 PDF BibTeX XML Cite \textit{E. Ben-Sasson} et al., Lect. Notes Comput. Sci. 10212, 551--579 (2017; Zbl 1415.94409) Full Text: DOI OpenURL
Brandão, Fernando G. S. L.; Harrow, Aram W. Quantum de Finetti theorems under local measurements with applications. (English) Zbl 1380.81068 Commun. Math. Phys. 353, No. 2, 469-506 (2017). Reviewer: Hichem Eleuch (College Station) MSC: 81P45 81P40 81P15 62C12 PDF BibTeX XML Cite \textit{F. G. S. L. Brandão} and \textit{A. W. Harrow}, Commun. Math. Phys. 353, No. 2, 469--506 (2017; Zbl 1380.81068) Full Text: DOI arXiv Link OpenURL
Baartse, Martijn; Meer, Klaus An algebraic proof of the real number PCP theorem. (English) Zbl 1370.68105 J. Complexity 40, 34-77 (2017). MSC: 68Q15 03D78 68Q05 PDF BibTeX XML Cite \textit{M. Baartse} and \textit{K. Meer}, J. Complexity 40, 34--77 (2017; Zbl 1370.68105) Full Text: DOI OpenURL
Manurangsi, Pasin; Moshkovitz, Dana Improved approximation algorithms for projection games. (English) Zbl 1359.68316 Algorithmica 77, No. 2, 555-594 (2017). MSC: 68W25 68Q17 91A43 PDF BibTeX XML Cite \textit{P. Manurangsi} and \textit{D. Moshkovitz}, Algorithmica 77, No. 2, 555--594 (2017; Zbl 1359.68316) Full Text: DOI arXiv OpenURL
Çivril, A. Sparse approximation is provably hard under coherent dictionaries. (English) Zbl 1354.65085 J. Comput. Syst. Sci. 84, 32-43 (2017). MSC: 65F50 65Y20 68Q17 PDF BibTeX XML Cite \textit{A. Çivril}, J. Comput. Syst. Sci. 84, 32--43 (2017; Zbl 1354.65085) Full Text: DOI arXiv OpenURL
Rosicka, M.; Ramanathan, R.; Gnaciński, P.; Horodecki, K.; Horodecki, M.; Horodecki, P.; Severini, S. Linear game non-contextuality and Bell inequalities – a graph-theoretic approach. (English) Zbl 1456.81019 New J. Phys. 18, No. 4, Article ID 045020, 22 p. (2016). MSC: 81P13 81P15 91A05 PDF BibTeX XML Cite \textit{M. Rosicka} et al., New J. Phys. 18, No. 4, Article ID 045020, 22 p. (2016; Zbl 1456.81019) Full Text: DOI arXiv OpenURL
Ding, Wei; Qiu, Ke A quadratic time exact algorithm for continuous connected 2-facility location problem in trees (extended abstract). (English) Zbl 1483.90074 Chan, T-H. Hubert (ed.) et al., Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16–18, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10043, 408-420 (2016). MSC: 90B85 68W40 90C27 PDF BibTeX XML Cite \textit{W. Ding} and \textit{K. Qiu}, Lect. Notes Comput. Sci. 10043, 408--420 (2016; Zbl 1483.90074) Full Text: DOI OpenURL
Lee, Chuan-Min On the complexity of variations of mixed domination on graphs. (English) Zbl 1355.05238 Int. J. Comput. Math. 93, No. 11, 1937-1963 (2016). MSC: 05C85 68Q17 90C27 PDF BibTeX XML Cite \textit{C.-M. Lee}, Int. J. Comput. Math. 93, No. 11, 1937--1963 (2016; Zbl 1355.05238) Full Text: DOI OpenURL
Ben-Sasson, Eli; Chiesa, Alessandro; Spooner, Nicholas Interactive oracle proofs. (English) Zbl 1397.94048 Hirt, Martin (ed.) et al., Theory of cryptography. 14th international conference, TCC 2016-B, Beijing, China, October 31 – November 3, 2016, Proceedings. Part II. Berlin: Springer (ISBN 978-3-662-53643-8/pbk; 978-3-662-53644-5/ebook). Lecture Notes in Computer Science 9986, 31-60 (2016). MSC: 94A60 PDF BibTeX XML Cite \textit{E. Ben-Sasson} et al., Lect. Notes Comput. Sci. 9986, 31--60 (2016; Zbl 1397.94048) Full Text: DOI OpenURL
Oono, Kenta; Yoshida, Yuichi Testing properties of functions on finite groups. (English) Zbl 1377.20013 Random Struct. Algorithms 49, No. 3, 579-598 (2016). MSC: 20C40 20C15 20D60 68W20 PDF BibTeX XML Cite \textit{K. Oono} and \textit{Y. Yoshida}, Random Struct. Algorithms 49, No. 3, 579--598 (2016; Zbl 1377.20013) Full Text: DOI arXiv OpenURL
Ben-Sasson, Eli; Viderman, Michael A combinatorial characterization of smooth LTCs and applications. (English) Zbl 1409.94921 Random Struct. Algorithms 49, No. 2, 280-307 (2016). MSC: 94B05 PDF BibTeX XML Cite \textit{E. Ben-Sasson} and \textit{M. Viderman}, Random Struct. Algorithms 49, No. 2, 280--307 (2016; Zbl 1409.94921) Full Text: DOI OpenURL
Agrawal, Manindra; Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin Jacobian hits circuits: hitting sets, lower bounds for depth-\(D\) occur-\(k\) formulas and depth-3 transcendence degree-\(k\) circuits. (English) Zbl 1350.68292 SIAM J. Comput. 45, No. 4, 1533-1562 (2016). MSC: 68W30 68Q05 68Q25 94C10 PDF BibTeX XML Cite \textit{M. Agrawal} et al., SIAM J. Comput. 45, No. 4, 1533--1562 (2016; Zbl 1350.68292) Full Text: DOI OpenURL
Mukhopadhyay, Partha Depth-4 identity testing and Noether’s normalization lemma. (English) Zbl 1476.68085 Kulikov, Alexander S. (ed.) et al., Computer science – theory and applications. 11th international computer science symposium in Russia, CSR 2016, St. Petersburg, Russia, June 9–13, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9691, 309-323 (2016). MSC: 68Q06 13P05 14Q20 68Q25 68W20 PDF BibTeX XML Cite \textit{P. Mukhopadhyay}, Lect. Notes Comput. Sci. 9691, 309--323 (2016; Zbl 1476.68085) Full Text: DOI OpenURL
Vidick, Thomas 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). MSC: 81P45 81P68 68Q10 91A06 81P40 81P15 68W25 PDF BibTeX XML Cite \textit{T. Vidick}, SIAM J. Comput. 45, No. 3, 1007--1063 (2016; Zbl 1342.81080) Full Text: DOI arXiv Link OpenURL
Grilo, Alex Bredariol; Kerenidis, Iordanis; Sikora, Jamie QMA with subset state witnesses. (English) Zbl 1356.68081 Chic. J. Theor. Comput. Sci. 2016, Article No. 4, 17 p. (2016). MSC: 68Q15 68Q12 PDF BibTeX XML Cite \textit{A. B. Grilo} et al., Chic. J. Theor. Comput. Sci. 2016, Article No. 4, 17 p. (2016; Zbl 1356.68081) Full Text: DOI OpenURL
Kol, Gillat; Raz, Ran Bounds on 2-query locally testable codes with affine tests. (English) Zbl 1357.68051 Inf. Process. Lett. 116, No. 8, 521-525 (2016). MSC: 68P30 68Q25 94B60 94B65 PDF BibTeX XML Cite \textit{G. Kol} and \textit{R. Raz}, Inf. Process. Lett. 116, No. 8, 521--525 (2016; Zbl 1357.68051) Full Text: DOI Link OpenURL
Ben-Sasson, Eli; Chiesa, Alessandro; Gabizon, Ariel; Virza, Madars Quasi-linear size zero knowledge from linear-algebraic PCPs. (English) Zbl 1375.94101 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, 33-64 (2016). MSC: 94A60 68Q15 PDF BibTeX XML Cite \textit{E. Ben-Sasson} et al., Lect. Notes Comput. Sci. 9563, 33--64 (2016; Zbl 1375.94101) Full Text: DOI OpenURL
Meir, Or Combinatorial PCPs with short proofs. (English) Zbl 1336.68090 Comput. Complexity 25, No. 1, 1-102 (2016). MSC: 68Q15 PDF BibTeX XML Cite \textit{O. Meir}, Comput. Complexity 25, No. 1, 1--102 (2016; Zbl 1336.68090) Full Text: DOI OpenURL
Brandão, Fernando G. S. L.; Harrow, Aram W. Product-state approximations to quantum states. (English) Zbl 1333.81447 Commun. Math. Phys. 342, No. 1, 47-80 (2016). MSC: 81V70 81P40 82C22 PDF BibTeX XML Cite \textit{F. G. S. L. Brandão} and \textit{A. W. Harrow}, Commun. Math. Phys. 342, No. 1, 47--80 (2016; Zbl 1333.81447) Full Text: DOI arXiv OpenURL
Tamaki, Suguru Parallel repetition of two-prover one-round games: an exposition. (English) Zbl 1484.68063 Interdiscip. Inf. Sci. 21, No. 4, 289-306 (2015). MSC: 68Q10 05C50 68Q17 68Q25 90C27 91A80 PDF BibTeX XML Cite \textit{S. Tamaki}, Interdiscip. Inf. Sci. 21, No. 4, 289--306 (2015; Zbl 1484.68063) Full Text: DOI OpenURL
Kobayashi, Hirotada; Le Gall, François; Nishimura, Harumichi Stronger methods of making quantum interactive proofs perfectly complete. (English) Zbl 1357.68071 SIAM J. Comput. 44, No. 2, 243-289 (2015). MSC: 68Q12 81P68 PDF BibTeX XML Cite \textit{H. Kobayashi} et al., SIAM J. Comput. 44, No. 2, 243--289 (2015; Zbl 1357.68071) Full Text: DOI arXiv OpenURL
Goldreich, Oded; Meir, Or Input-oblivious proof systems and a uniform complexity perspective on P/poly. (English) Zbl 1347.68160 ACM Trans. Comput. Theory 7, No. 4, Article No. 16, 13 p. (2015). MSC: 68Q15 68Q10 PDF BibTeX XML Cite \textit{O. Goldreich} and \textit{O. Meir}, ACM Trans. Comput. Theory 7, No. 4, Article No. 16, 13 p. (2015; Zbl 1347.68160) Full Text: DOI Link OpenURL
Regev, Oded; Vidick, Thomas Quantum XOR games. (English) Zbl 1348.81177 ACM Trans. Comput. Theory 7, No. 4, Article No. 15, 43 p. (2015). MSC: 81P68 81P40 91A80 PDF BibTeX XML Cite \textit{O. Regev} and \textit{T. Vidick}, ACM Trans. Comput. Theory 7, No. 4, Article No. 15, 43 p. (2015; Zbl 1348.81177) Full Text: DOI arXiv OpenURL
Aharonov, Dorit; Eldar, Lior Quantum locally testable codes. (English) Zbl 1326.81054 SIAM J. Comput. 44, No. 5, 1230-1262 (2015). MSC: 81P70 81P40 81P45 81P68 94B60 94B70 PDF BibTeX XML Cite \textit{D. Aharonov} and \textit{L. Eldar}, SIAM J. Comput. 44, No. 5, 1230--1262 (2015; Zbl 1326.81054) Full Text: DOI arXiv OpenURL
Coudron, Matthew; Vidick, Thomas Interactive proofs with approximately commuting provers. (English) Zbl 1441.68088 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, 355-366 (2015). MSC: 68Q25 81P40 81P68 94A60 PDF BibTeX XML Cite \textit{M. Coudron} and \textit{T. Vidick}, Lect. Notes Comput. Sci. 9134, 355--366 (2015; Zbl 1441.68088) Full Text: DOI arXiv Link OpenURL
Bhangale, Amey; Kopparty, Swastik; Sachdeva, Sushant Simultaneous approximation of constraint satisfaction problems. (English) Zbl 1403.68341 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 (ISBN 978-3-662-47671-0/pbk; 978-3-662-47672-7/ebook). Lecture Notes in Computer Science 9134, 193-205 (2015). MSC: 68W25 68Q25 PDF BibTeX XML Cite \textit{A. Bhangale} et al., Lect. Notes Comput. Sci. 9134, 193--205 (2015; Zbl 1403.68341) Full Text: DOI arXiv OpenURL
Tamaki, Suguru; Yoshida, Yuichi A query efficient non-adaptive long code test with perfect completeness. (English) Zbl 1341.68066 Random Struct. Algorithms 47, No. 2, 386-406 (2015). MSC: 68Q25 68W20 68W25 PDF BibTeX XML Cite \textit{S. Tamaki} and \textit{Y. Yoshida}, Random Struct. Algorithms 47, No. 2, 386--406 (2015; Zbl 1341.68066) Full Text: DOI Link OpenURL
Paschos, Vangelis Th. When polynomial approximation meets exact computation. (English) Zbl 1355.68128 4OR 13, No. 3, 227-245 (2015). MSC: 68Q25 05C85 68W25 PDF BibTeX XML Cite \textit{V. Th. Paschos}, 4OR 13, No. 3, 227--245 (2015; Zbl 1355.68128) Full Text: DOI OpenURL
Chiesa, Alessandro; Zhu, Zeyuan Allen Shorter arithmetization of nondeterministic computations. (English) Zbl 1430.68108 Theor. Comput. Sci. 600, 107-131 (2015). MSC: 68Q04 68Q09 68Q10 68Q17 68Q25 PDF BibTeX XML Cite \textit{A. Chiesa} and \textit{Z. A. Zhu}, Theor. Comput. Sci. 600, 107--131 (2015; Zbl 1430.68108) Full Text: DOI OpenURL
Demirci, H. Gökalp; Say, A. C. Cem; Yakaryılmaz, Abuzer The complexity of debate checking. (English) Zbl 1329.68108 Theory Comput. Syst. 57, No. 1, 36-80 (2015). MSC: 68Q05 68Q10 68Q15 68Q45 PDF BibTeX XML Cite \textit{H. G. Demirci} et al., Theory Comput. Syst. 57, No. 1, 36--80 (2015; Zbl 1329.68108) Full Text: DOI OpenURL
Gupta, A.; Könemann, Jochen; Leonardi, S.; Ravi, R.; Schäfer, G. Efficient cost-sharing mechanisms for prize-collecting problems. (English) Zbl 1319.90056 Math. Program. 152, No. 1-2 (A), 147-188 (2015). MSC: 90C27 68R99 91A10 PDF BibTeX XML Cite \textit{A. Gupta} et al., Math. Program. 152, No. 1--2 (A), 147--188 (2015; Zbl 1319.90056) Full Text: DOI Link OpenURL
Karpinski, Marek; Lampis, Michael; Schmied, Richard New inapproximability bounds for TSP. (English) Zbl 1328.68076 J. Comput. Syst. Sci. 81, No. 8, 1665-1677 (2015). MSC: 68Q17 90C27 90C60 PDF BibTeX XML Cite \textit{M. Karpinski} et al., J. Comput. Syst. Sci. 81, No. 8, 1665--1677 (2015; Zbl 1328.68076) Full Text: DOI OpenURL
Baartse, Martijn; Meer, Klaus The PCP theorem for NP over the reals. (English) Zbl 1327.68107 Found. Comput. Math. 15, No. 3, 651-680 (2015). MSC: 68Q15 03D78 PDF BibTeX XML Cite \textit{M. Baartse} and \textit{K. Meer}, Found. Comput. Math. 15, No. 3, 651--680 (2015; Zbl 1327.68107) Full Text: DOI Link OpenURL
Cooney, T.; Junge, M.; Palazuelos, C.; Pérez-García, D. Rank-one quantum games. (English) Zbl 1328.81063 Comput. Complexity 24, No. 1, 133-196 (2015). Reviewer: Ahmed Hegazi (Mansoura) MSC: 81P45 91A05 81P40 68Q25 47L25 PDF BibTeX XML Cite \textit{T. Cooney} et al., Comput. Complexity 24, No. 1, 133--196 (2015; Zbl 1328.81063) Full Text: DOI arXiv Link OpenURL
Biniaz, Ahmad; Maheshwari, Anil; Smid, Michiel On full Steiner trees in unit disk graphs. (English) Zbl 1319.05037 Comput. Geom. 48, No. 6, 453-458 (2015). Reviewer: T. Tamizh Chelvam (Tamilnadu) MSC: 05C05 05C22 68W25 PDF BibTeX XML Cite \textit{A. Biniaz} et al., Comput. Geom. 48, No. 6, 453--458 (2015; Zbl 1319.05037) Full Text: DOI OpenURL
Viderman, Michael A combination of testability and decodability by tensor products. (English) Zbl 1316.94112 Random Struct. Algorithms 46, No. 3, 572-598 (2015). MSC: 94B05 94B35 PDF BibTeX XML Cite \textit{M. Viderman}, Random Struct. Algorithms 46, No. 3, 572--598 (2015; Zbl 1316.94112) Full Text: DOI Link OpenURL
Gevezes, Theodoros; Pitsoulis, Leonidas A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem. (English) Zbl 1320.90069 J. Comb. Optim. 29, No. 4, 859-883 (2015). MSC: 90C27 90C59 90C90 PDF BibTeX XML Cite \textit{T. Gevezes} and \textit{L. Pitsoulis}, J. Comb. Optim. 29, No. 4, 859--883 (2015; Zbl 1320.90069) Full Text: DOI OpenURL
Bonnet, Edouard; Escoffier, Bruno; Kim, Eun; Paschos, Vangelis On subexponential and FPT-time inapproximability. (English) Zbl 1312.68232 Algorithmica 71, No. 3, 541-565 (2015). MSC: 68W25 05C69 68Q17 68Q25 PDF BibTeX XML Cite \textit{E. Bonnet} et al., Algorithmica 71, No. 3, 541--565 (2015; Zbl 1312.68232) Full Text: DOI arXiv OpenURL
Aharonov, Dorit; Eldar, Lior The commuting local Hamiltonian problem on locally expanding graphs is approximable in \(\mathsf{NP}\). (English) Zbl 1327.68105 Quantum Inf. Process. 14, No. 1, 83-101 (2015). MSC: 68Q12 68Q17 81P68 81Q35 PDF BibTeX XML Cite \textit{D. Aharonov} and \textit{L. Eldar}, Quantum Inf. Process. 14, No. 1, 83--101 (2015; Zbl 1327.68105) Full Text: DOI arXiv OpenURL
Abu-Affash, A. Karim The Euclidean bottleneck full Steiner tree problem. (English) Zbl 1307.68056 Algorithmica 71, No. 1, 139-151 (2015). MSC: 68R10 05C05 68Q17 68Q25 68U05 68W05 68W25 PDF BibTeX XML Cite \textit{A. K. Abu-Affash}, Algorithmica 71, No. 1, 139--151 (2015; Zbl 1307.68056) Full Text: DOI OpenURL
Jukna, Stasys Limitations of incremental dynamic programming. (English) Zbl 1360.90269 Algorithmica 69, No. 2, 461-492 (2014). MSC: 90C39 68P05 68Q17 68W05 90C27 PDF BibTeX XML Cite \textit{S. Jukna}, Algorithmica 69, No. 2, 461--492 (2014; Zbl 1360.90269) Full Text: DOI Link OpenURL
Kanade, Varun; Steinke, Thomas Learning hurdles for sleeping experts. (English) Zbl 1347.68192 ACM Trans. Comput. Theory 6, No. 3, Article No. 11, 16 p. (2014). MSC: 68Q32 68T05 68W27 91A60 PDF BibTeX XML Cite \textit{V. Kanade} and \textit{T. Steinke}, ACM Trans. Comput. Theory 6, No. 3, Article No. 11, 16 p. (2014; Zbl 1347.68192) Full Text: DOI OpenURL
Kopparty, Swastik; Saraf, Shubhangi; Yekhanin, Sergey High-rate codes with sublinear-time decoding. (English) Zbl 1321.94138 J. ACM 61, No. 5, Article No. 28, 20 p. (2014). MSC: 94B35 68Q25 68P30 PDF BibTeX XML Cite \textit{S. Kopparty} et al., J. ACM 61, No. 5, Article No. 28, 20 p. (2014; Zbl 1321.94138) Full Text: DOI OpenURL
Boros, Endre; Gruber, Aritanan Hardness results for approximate pure Horn CNF formulae minimization. (English) Zbl 1320.68089 Ann. Math. Artif. Intell. 71, No. 4, 327-363 (2014). MSC: 68Q17 06E30 68T27 PDF BibTeX XML Cite \textit{E. Boros} and \textit{A. Gruber}, Ann. Math. Artif. Intell. 71, No. 4, 327--363 (2014; Zbl 1320.68089) Full Text: DOI arXiv OpenURL
Meir, Or Combinatorial PCPs with efficient verifiers. (English) Zbl 1318.68087 Comput. Complexity 23, No. 3, 355-478 (2014). MSC: 68Q15 PDF BibTeX XML Cite \textit{O. Meir}, Comput. Complexity 23, No. 3, 355--478 (2014; Zbl 1318.68087) Full Text: DOI Link OpenURL
Costa Florêncio, Christophe; Verwer, Sicco Regular inference as vertex coloring. (English) Zbl 1360.68524 Theor. Comput. Sci. 558, 18-34 (2014). MSC: 68Q32 05C15 PDF BibTeX XML Cite \textit{C. Costa Florêncio} and \textit{S. Verwer}, Theor. Comput. Sci. 558, 18--34 (2014; Zbl 1360.68524) Full Text: DOI OpenURL
Bermudo, S.; Fernau, H. Computing the differential of a graph: hardness, approximability and exact algorithms. (English) Zbl 1288.05262 Discrete Appl. Math. 165, 69-82 (2014). MSC: 05C85 68Q17 68R10 68M10 68W40 PDF BibTeX XML Cite \textit{S. Bermudo} and \textit{H. Fernau}, Discrete Appl. Math. 165, 69--82 (2014; Zbl 1288.05262) Full Text: DOI OpenURL
Çivril, A. Column subset selection problem is UG-hard. (English) Zbl 1285.68052 J. Comput. Syst. Sci. 80, No. 4, 849-859 (2014). MSC: 68Q17 65F30 PDF BibTeX XML Cite \textit{A. Çivril}, J. Comput. Syst. Sci. 80, No. 4, 849--859 (2014; Zbl 1285.68052) Full Text: DOI OpenURL
Shahinpour, Shahram; Butenko, Sergiy Distance-based clique relaxations in networks: \(s\)-clique and \(s\)-club. (English) Zbl 1344.90064 Goldengorin, Boris I. (ed.) et al., Models, algorithms, and technologies for network analysis. Proceedings of the second international conference on network analysis, Nizhny Novgorod, Russia, May 7–9, 2012. New York, NY: Springer (ISBN 978-1-4614-8587-2/hbk; 978-1-4614-8588-9/ebook). Springer Proceedings in Mathematics & Statistics 59, 149-174 (2013). MSC: 90C35 05C85 PDF BibTeX XML Cite \textit{S. Shahinpour} and \textit{S. Butenko}, Springer Proc. Math. Stat. 59, 149--174 (2013; Zbl 1344.90064) Full Text: DOI OpenURL
Oriolo, Gianpaolo; Sanità, Laura; Zenklusen, Rico Network design with a discrete set of traffic matrices. (English) Zbl 1286.90023 Oper. Res. Lett. 41, No. 4, 390-396 (2013). MSC: 90B10 PDF BibTeX XML Cite \textit{G. Oriolo} et al., Oper. Res. Lett. 41, No. 4, 390--396 (2013; Zbl 1286.90023) Full Text: DOI OpenURL
Babbush, Ryan; O’Gorman, Bryan; Aspuru-Guzik, Alán Resource efficient gadgets for compiling adiabatic quantum optimization problems. (English) Zbl 1279.81041 Ann. Phys., Berlin 525, No. 10-11, 877-888 (2013). MSC: 81P70 94C10 81P68 PDF BibTeX XML Cite \textit{R. Babbush} et al., Ann. Phys., Berlin 525, No. 10--11, 877--888 (2013; Zbl 1279.81041) Full Text: DOI arXiv OpenURL
Escoffier, Bruno; Paschos, Vangelis Th.; Tourniaire, Emeric Moderately exponential time and fixed parameter approximation algorithms. (English) Zbl 1310.68239 Optimization 62, No. 8, 1019-1036 (2013). MSC: 68W25 05C69 05C70 05C85 68Q17 68Q25 90C27 PDF BibTeX XML Cite \textit{B. Escoffier} et al., Optimization 62, No. 8, 1019--1036 (2013; Zbl 1310.68239) Full Text: DOI OpenURL
Chatterjee, Krishnendu; De Alfaro, Luca; Majumdar, Rupak The complexity of coverage. (English) Zbl 1286.68310 Int. J. Found. Comput. Sci. 24, No. 2, 165-185 (2013). MSC: 68Q60 68N30 68Q25 91A80 91A20 68Q45 PDF BibTeX XML Cite \textit{K. Chatterjee} et al., Int. J. Found. Comput. Sci. 24, No. 2, 165--185 (2013; Zbl 1286.68310) Full Text: DOI OpenURL
Boyar, Joan; Matthews, Philip; Peralta, René Logic minimization techniques with applications to cryptology. (English) Zbl 1279.94056 J. Cryptology 26, No. 2, 280-312 (2013). MSC: 94A60 68Q30 PDF BibTeX XML Cite \textit{J. Boyar} et al., J. Cryptology 26, No. 2, 280--312 (2013; Zbl 1279.94056) Full Text: DOI OpenURL
Grigorescu, Elena; Kaufman, Tali; Sudan, Madhu 2-transitivity is insufficient for local testability. (English) Zbl 1283.94130 Comput. Complexity 22, No. 1, 137-158 (2013). Reviewer: Adrian Atanasiu (Bucureşti) MSC: 94B15 68W20 68Q25 11T71 PDF BibTeX XML Cite \textit{E. Grigorescu} et al., Comput. Complexity 22, No. 1, 137--158 (2013; Zbl 1283.94130) Full Text: DOI OpenURL
Saha, Chandan; Saptharishi, Ramprasad; Saxena, Nitin A case of depth-3 identity testing, sparse factorization and duality. (English) Zbl 1311.68201 Comput. Complexity 22, No. 1, 39-69 (2013). MSC: 68W30 68Q25 94C12 PDF BibTeX XML Cite \textit{C. Saha} et al., Comput. Complexity 22, No. 1, 39--69 (2013; Zbl 1311.68201) Full Text: DOI OpenURL
Chen, Zhixiang; Fu, Bin Approximating multilinear monomial coefficients and maximum multilinear monomials in multivariate polynomials. (English) Zbl 1288.90072 J. Comb. Optim. 25, No. 2, 234-254 (2013). MSC: 90C27 68Q17 68W20 68W25 PDF BibTeX XML Cite \textit{Z. Chen} and \textit{B. Fu}, J. Comb. Optim. 25, No. 2, 234--254 (2013; Zbl 1288.90072) Full Text: DOI OpenURL
Çivril, Ali; Magdon-Ismail, Malik Exponential inapproximability of selecting a maximum volume sub-matrix. (English) Zbl 1259.68086 Algorithmica 65, No. 1, 159-176 (2013). MSC: 68Q25 68Q17 PDF BibTeX XML Cite \textit{A. Çivril} and \textit{M. Magdon-Ismail}, Algorithmica 65, No. 1, 159--176 (2013; Zbl 1259.68086) Full Text: DOI arXiv OpenURL
Cheriyan, Joseph; Laekhanukit, Bundit; Naves, Guyslain; Vetta, Adrian Approximating rooted Steiner networks. (English) Zbl 1421.68202 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1499-1511 (2012). MSC: 68W25 05C40 68Q17 68R10 PDF BibTeX XML Cite \textit{J. Cheriyan} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1499--1511 (2012; Zbl 1421.68202) Full Text: Link OpenURL