Melissinos, Nikolaos; Pagourtzis, Aris; Triommatis, Theofilos Approximation schemes for subset-sums ratio problems. (English) Zbl 07579632 Theor. Comput. Sci. 931, 17-30 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{N. Melissinos} et al., Theor. Comput. Sci. 931, 17--30 (2022; Zbl 07579632) Full Text: DOI
Ye, Zekun; Li, Lvzhou Sample complexity of hidden subgroup problem. (English) Zbl 07540198 Theor. Comput. Sci. 922, 108-121 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{Z. Ye} and \textit{L. Li}, Theor. Comput. Sci. 922, 108--121 (2022; Zbl 07540198) Full Text: DOI arXiv
Jančar, Petr Bisimilarity on basic parallel processes. (English) Zbl 07467467 Theor. Comput. Sci. 903, 26-38 (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{P. Jančar}, Theor. Comput. Sci. 903, 26--38 (2022; Zbl 07467467) Full Text: DOI
Alon, Bar; Paskin-Cherniavsky, Anat On perfectly secure 2PC in the OT-hybrid model. (English) Zbl 1514.94030 Theor. Comput. Sci. 891, 166-188 (2021). MSC: 94A60 68Q10 PDFBibTeX XMLCite \textit{B. Alon} and \textit{A. Paskin-Cherniavsky}, Theor. Comput. Sci. 891, 166--188 (2021; Zbl 1514.94030) Full Text: DOI
Li, Yaqiao Conflict complexity is lower bounded by block sensitivity. (English) Zbl 1477.68107 Theor. Comput. Sci. 856, 169-172 (2021). MSC: 68Q06 06E30 PDFBibTeX XMLCite \textit{Y. Li}, Theor. Comput. Sci. 856, 169--172 (2021; Zbl 1477.68107) Full Text: DOI arXiv
Dinesh, Krishnamoorthy; Otiv, Samir; Sarma, Jayalal New bounds for energy complexity of Boolean functions. (English) Zbl 1467.68053 Theor. Comput. Sci. 845, 59-75 (2020). MSC: 68Q06 94C11 PDFBibTeX XMLCite \textit{K. Dinesh} et al., Theor. Comput. Sci. 845, 59--75 (2020; Zbl 1467.68053) Full Text: DOI arXiv
Hosoyamada, Akinori; Sasaki, Yu; Tani, Seiichiro; Xagawa, Keita Quantum algorithm for the multicollision problem. (English) Zbl 1455.68067 Theor. Comput. Sci. 842, 100-117 (2020). MSC: 68Q12 81P94 94A60 PDFBibTeX XMLCite \textit{A. Hosoyamada} et al., Theor. Comput. Sci. 842, 100--117 (2020; Zbl 1455.68067) Full Text: DOI arXiv
Aceto, Luca; Anastasiadi, Elli; Castiglioni, Valentina; Ingólfsdóttir, Anna; Luttik, Bas; Pedersen, Mathias Ruggaard On the axiomatisability of priority. III: Priority strikes again. (English) Zbl 1452.68124 Theor. Comput. Sci. 837, 223-246 (2020). MSC: 68Q85 03B70 PDFBibTeX XMLCite \textit{L. Aceto} et al., Theor. Comput. Sci. 837, 223--246 (2020; Zbl 1452.68124) Full Text: DOI
Dinesh, Krishnamoorthy; Sarma, Jayalal Alternation, sparsity and sensitivity: bounds and exponential gaps. (English) Zbl 1422.68109 Theor. Comput. Sci. 771, 71-82 (2019). MSC: 68Q25 06E30 94C10 PDFBibTeX XMLCite \textit{K. Dinesh} and \textit{J. Sarma}, Theor. Comput. Sci. 771, 71--82 (2019; Zbl 1422.68109) Full Text: DOI arXiv
Ivanyos, Gábor; Santha, Miklos Solving systems of diagonal polynomial equations over finite fields. (English) Zbl 1356.68281 Theor. Comput. Sci. 657, Part A, 73-85 (2017). MSC: 68W30 12Y05 68Q12 PDFBibTeX XMLCite \textit{G. Ivanyos} and \textit{M. Santha}, Theor. Comput. Sci. 657, Part A, 73--85 (2017; Zbl 1356.68281) Full Text: DOI
Guo, Siyao; Komargodski, Ilan Negation-limited formulas. (English) Zbl 1357.68058 Theor. Comput. Sci. 660, 75-85 (2017). MSC: 68Q05 68Q17 68Q25 94C10 PDFBibTeX XMLCite \textit{S. Guo} and \textit{I. Komargodski}, Theor. Comput. Sci. 660, 75--85 (2017; Zbl 1357.68058) Full Text: DOI
Le Gall, François; Nishimura, Harumichi; Tani, Seiichiro Quantum algorithms for finding constant-sized sub-hypergraphs. (English) Zbl 1333.68115 Theor. Comput. Sci. 609, Part 3, 569-582 (2016). MSC: 68Q12 05C65 05C85 PDFBibTeX XMLCite \textit{F. Le Gall} et al., Theor. Comput. Sci. 609, Part 3, 569--582 (2016; Zbl 1333.68115) Full Text: DOI arXiv
Bouda, Jan; Pivoluska, Matej; Plesch, Martin Improving the Hadamard extractor. (English) Zbl 1253.68254 Theor. Comput. Sci. 459, 69-76 (2012). MSC: 68Q87 94A60 81P68 PDFBibTeX XMLCite \textit{J. Bouda} et al., Theor. Comput. Sci. 459, 69--76 (2012; Zbl 1253.68254) Full Text: DOI
Iwama, Kazuo; Nishimura, Harumichi; Raymond, Rudy; Teruyama, Junichi Quantum counterfeit coin problems. (English) Zbl 1253.68177 Theor. Comput. Sci. 456, 51-64 (2012). MSC: 68Q25 68Q12 PDFBibTeX XMLCite \textit{K. Iwama} et al., Theor. Comput. Sci. 456, 51--64 (2012; Zbl 1253.68177) Full Text: DOI
Bozzelli, Laura; Legay, Axel; Pinchinat, Sophie Hardness of preorder checking for basic formalisms. (English) Zbl 1227.68072 Theor. Comput. Sci. 412, No. 49, 6795-6808 (2011). MSC: 68Q60 68Q17 PDFBibTeX XMLCite \textit{L. Bozzelli} et al., Theor. Comput. Sci. 412, No. 49, 6795--6808 (2011; Zbl 1227.68072) Full Text: DOI
Zhang, Wen-Qi; Liu, Yong-Jin Approximating the longest paths in grid graphs. (English) Zbl 1222.68089 Theor. Comput. Sci. 412, No. 39, 5340-5350 (2011). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{W.-Q. Zhang} and \textit{Y.-J. Liu}, Theor. Comput. Sci. 412, No. 39, 5340--5350 (2011; Zbl 1222.68089) Full Text: DOI
Tani, Seiichiro Claw finding algorithms using quantum walk. (English) Zbl 1191.68327 Theor. Comput. Sci. 410, No. 50, 5285-5297 (2009). MSC: 68Q10 81P68 68Q12 PDFBibTeX XMLCite \textit{S. Tani}, Theor. Comput. Sci. 410, No. 50, 5285--5297 (2009; Zbl 1191.68327) Full Text: DOI
Chen, Xi; Deng, Xiaotie On the complexity of 2D discrete fixed point problem. (English) Zbl 1183.68294 Theor. Comput. Sci. 410, No. 44, 4448-4456 (2009). MSC: 68Q15 68R10 PDFBibTeX XMLCite \textit{X. Chen} and \textit{X. Deng}, Theor. Comput. Sci. 410, No. 44, 4448--4456 (2009; Zbl 1183.68294) Full Text: DOI
Morizumi, Hiroki Limiting negations in non-deterministic circuits. (English) Zbl 1170.94347 Theor. Comput. Sci. 410, No. 38-40, 3988-3994 (2009). MSC: 94C05 PDFBibTeX XMLCite \textit{H. Morizumi}, Theor. Comput. Sci. 410, No. 38--40, 3988--3994 (2009; Zbl 1170.94347) Full Text: DOI
Manthey, Bodo; Reischuk, Rüdiger Smoothed analysis of binary search trees. (English) Zbl 1120.68043 Theor. Comput. Sci. 378, No. 3, 292-315 (2007). MSC: 68P05 68P10 PDFBibTeX XMLCite \textit{B. Manthey} and \textit{R. Reischuk}, Theor. Comput. Sci. 378, No. 3, 292--315 (2007; Zbl 1120.68043) Full Text: DOI
Zhang, Zhao; Li, Hao Algorithms for long paths in graphs. (English) Zbl 1117.68057 Theor. Comput. Sci. 377, No. 1-3, 25-34 (2007). MSC: 68R10 05C85 05C38 PDFBibTeX XMLCite \textit{Z. Zhang} and \textit{H. Li}, Theor. Comput. Sci. 377, No. 1--3, 25--34 (2007; Zbl 1117.68057) Full Text: DOI
Ambainis, Andris; Iwama, Kazuo; Kawachi, Akinori; Raymond, Rudy; Yamashita, Shigeru Improved algorithms for quantum identification of Boolean oracles. (English) Zbl 1118.68065 Theor. Comput. Sci. 378, No. 1, 41-53 (2007). MSC: 68Q10 68Q32 81P68 68W05 PDFBibTeX XMLCite \textit{A. Ambainis} et al., Theor. Comput. Sci. 378, No. 1, 41--53 (2007; Zbl 1118.68065) Full Text: DOI
Mayr, Richard Weak bisimilarity and regularity of context-free processes is EXPTIME-hard. (English) Zbl 1078.68109 Theor. Comput. Sci. 330, No. 3, 553-575 (2005). MSC: 68Q85 68Q45 PDFBibTeX XMLCite \textit{R. Mayr}, Theor. Comput. Sci. 330, No. 3, 553--575 (2005; Zbl 1078.68109) Full Text: DOI
Hoang, Thanh Minh; Thierauf, Thomas The complexity of the characteristic and the minimal polynomial. (English) Zbl 1045.68067 Theor. Comput. Sci. 295, No. 1-3, 205-222 (2003). MSC: 68Q25 PDFBibTeX XMLCite \textit{T. M. Hoang} and \textit{T. Thierauf}, Theor. Comput. Sci. 295, No. 1--3, 205--222 (2003; Zbl 1045.68067) Full Text: DOI
Arvind, V.; Köbler, J. On pseudorandomness and resource-bounded measure. (English) Zbl 0974.68063 Theor. Comput. Sci. 255, No. 1-2, 205-221 (2001). MSC: 68Q15 PDFBibTeX XMLCite \textit{V. Arvind} and \textit{J. Köbler}, Theor. Comput. Sci. 255, No. 1--2, 205--221 (2001; Zbl 0974.68063) Full Text: DOI
Sengupta, R.; Venkateswaran, H. Non-cancellative Boolean circuits: A generalization of monotone boolean circuits. (English) Zbl 0939.68043 Theor. Comput. Sci. 237, No. 1-2, 197-212 (2000). MSC: 68Q15 PDFBibTeX XMLCite \textit{R. Sengupta} and \textit{H. Venkateswaran}, Theor. Comput. Sci. 237, No. 1--2, 197--212 (2000; Zbl 0939.68043) Full Text: DOI
Otto, Martin Bisimulation-invariant PTIME and higher-dimensional \(\mu\)-calculus. (English) Zbl 0930.03030 Theor. Comput. Sci. 224, No. 1-2, 237-265 (1999). MSC: 03B70 68Q19 03C13 03B45 68Q60 PDFBibTeX XMLCite \textit{M. Otto}, Theor. Comput. Sci. 224, No. 1--2, 237--265 (1999; Zbl 0930.03030) Full Text: DOI
Yen, Hsu-Chun; Jian, Shi-Tsuen; Lao, Ta-Pang Deciding bisimulation and trace equivalences for systems with many identical processes. (English) Zbl 0874.68119 Theor. Comput. Sci. 170, No. 1-2, 445-464 (1996). MSC: 68Q10 68Q55 68Q25 PDFBibTeX XMLCite \textit{H.-C. Yen} et al., Theor. Comput. Sci. 170, No. 1--2, 445--464 (1996; Zbl 0874.68119) Full Text: DOI
Bovet, Daniel P.; Crescenzi, Pierluigi; Silvestri, Riccardo A uniform approach to define complexity classes. (English) Zbl 0754.68049 Theor. Comput. Sci. 104, No. 2, 263-283 (1992). MSC: 68Q15 PDFBibTeX XMLCite \textit{D. P. Bovet} et al., Theor. Comput. Sci. 104, No. 2, 263--283 (1992; Zbl 0754.68049) Full Text: DOI