Richards, Dana; Hamburger, Henry Logic and language models for computer science. 3rd edition. (English) Zbl 07662225 Singapore: World Scientific (ISBN 978-981-12-6066-7/hbk; 978-981-12-6068-1/ebook). (2023). MSC: 68-01 03-01 03B70 68N17 68Q05 68Q42 68Q45 68Q55 68Q60 × Cite Format Result Cite Review PDF Full Text: DOI
Li, Yaqiao; McKenzie, Pierre Perspective on complexity measures targetting read-once branching programs. arXiv:2305.11276 Preprint, arXiv:2305.11276 [cs.CC] (2023). MSC: 68Q05 68R05 × Cite Format Result Cite Full Text: arXiv
Barbieri, Sebastián; Kari, Jarkko; Salo, Ville The group of reversible Turing machines: subgroups, generators and computability. arXiv:2303.17270 Preprint, arXiv:2303.17270 [math.GR] (2023). MSC: 68Q05 68Q80 37B15 37B10 37B50 × Cite Format Result Cite Full Text: arXiv OA License
Geffert, Viliam; Kapoutsis, Christos A.; Zakzok, Mohammad Improved complement for two-way alternating automata. (English) Zbl 07592345 Acta Inf. 59, No. 5, 619-669 (2022). MSC: 68Q05 68Q10 68Q19 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Hannula, Miika; Virtema, Jonni Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals. (English) Zbl 07587328 Ann. Pure Appl. Logic 173, No. 10, Article ID 103108, 30 p. (2022). MSC: 03B70 03B60 68Q19 03D15 68Q05 68T27 × Cite Format Result Cite Review PDF Full Text: DOI
Lee, Edward A. Observation and interaction. Invited paper. (English) Zbl 1425.68111 Martín-Vide, Carlos (ed.) et al., Language and automata theory and applications. 13th international conference, LATA 2019, St. Petersburg, Russia, March 26–29, 2019, Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11417, 31-42 (2019). MSC: 68Q05 68Q10 68Q45 68Q87 × Cite Format Result Cite Review PDF Full Text: DOI
Jebasingh, S.; Robinson, T.; Nagar, Atulya K. P system generating triangular pictures. (English) Zbl 1423.68257 Adv. Appl. Discrete Math. 20, No. 1, 1-12 (2019). MSC: 68Q45 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Di Ventra, Massimiliano; Ovchinnikov, Igor V. Digital memcomputing: from logic to dynamics to topology. (English) Zbl 1425.68110 Ann. Phys. 409, Article ID 167935, 12 p. (2019). MSC: 68Q05 37H10 81T60 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Marquer, Yoann Algorithmic completeness of imperative programming languages. (English) Zbl 1423.68087 Fundam. Inform. 168, No. 1, 51-77 (2019). MSC: 68N15 68N30 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Jiang, Suxia; Wang, Yanfeng; Xu, Fei; Deng, Junli Communication P systems with channel states working in flat maximally parallel manner. (English) Zbl 1423.68171 Fundam. Inform. 168, No. 1, 1-24 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Thomsen, Michael Kirkedal (ed.); Soeken, Mathias (ed.) Reversible computation. 11th international conference, RC 2019, Lausanne, Switzerland, June 24–25, 2019, Proceedings. (English) Zbl 1420.68014 Lecture Notes in Computer Science 11497. Cham: Springer (ISBN 978-3-030-21499-9/pbk; 978-3-030-21500-2/ebook). viii, 247 p. (2019). MSC: 68-06 68Q05 68Q10 81P68 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Lagarde, Guillaume; Malod, Guillaume; Perifel, Sylvain Non-commutative computations: lower bounds and polynomial identity testing. (English) Zbl 1422.68070 Chic. J. Theor. Comput. Sci. 2019, Article No. 2, 19 p. (2019). MSC: 68Q05 68Q10 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Bibi, Alia; Xu, Fei; Adorna, Henry N.; Cabarle, Francis George C. Sequential spiking neural P systems with local scheduled synapses without delay. (English) Zbl 1420.68087 Complexity 2019, Article ID 7313414, 12 p. (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Lagarde, Guillaume; Limaye, Nutan; Srinivasan, Srikanth Lower bounds and PIT for non-commutative arithmetic circuits with restricted parse trees. (English) Zbl 1422.68086 Comput. Complexity 28, No. 3, 471-542 (2019). MSC: 68Q17 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Savchuk, M. M.; Fesenko, A. V. Quantum computing: survey and analysis. (English. Russian original) Zbl 1418.81019 Cybern. Syst. Anal. 55, No. 1, 10-21 (2019); translation from Kibern. Sist. Anal. 2019, No. 1, 14-29 (2019). MSC: 81P68 68Q05 68Q12 81P94 × Cite Format Result Cite Review PDF Full Text: DOI
Yamada, Norihiro A game-semantic model of computation. (English) Zbl 1416.68073 Res. Math. Sci. 6, No. 1, Paper No. 3, 79 p. (2019). MSC: 68Q05 03D10 03D75 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Thachuk, Chris (ed.); Liu, Yan (ed.) DNA computing and molecular programming. 25th international conference, DNA 25, Seattle, WA, USA, August 5–9, 2019. Proceedings. (English) Zbl 1419.68019 Lecture Notes in Computer Science 11648. Cham: Springer (ISBN 978-3-030-26806-0/pbk; 978-3-030-26807-7/ebook). xii, 237 p. (2019). MSC: 68-06 68Q05 68Q10 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Pan, Tong; Xu, Jinbang; Jiang, Suxia; Xu, Fei Cell-like spiking neural P systems with evolution rules. (English) Zbl 1418.68092 Soft Comput. 23, No. 14, 5401-5409 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Jiang, Suxia; Wang, Yanfeng; Su, Yansen A uniform solution to SAT problem by symport/antiport P systems with channel states and membrane division. (English) Zbl 1418.68090 Soft Comput. 23, No. 12, 3903-3911 (2019). MSC: 68Q05 68Q10 68Q25 68T20 × Cite Format Result Cite Review PDF Full Text: DOI
Kohler, Tamara; Cubitt, Toby Translationally invariant universal classical Hamiltonians. (English) Zbl 1421.82005 J. Stat. Phys. 176, No. 1, 228-261 (2019). MSC: 82B20 81P68 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Liu, Liucheng; Yi, Wenmei; Yang, Qian; Peng, Hong; Wang, Jun Numerical P systems with Boolean condition. (English) Zbl 1423.68173 Theor. Comput. Sci. 785, 140-149 (2019). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Han, Yo-Sub; Kim, Hwee Ruleset optimization on isomorphic oritatami systems. (English) Zbl 1423.68169 Theor. Comput. Sci. 785, 128-139 (2019). MSC: 68Q05 92D20 × Cite Format Result Cite Review PDF Full Text: DOI Link
Ellingham, M. N.; Ellis-Monaghan, Joanna A. Edge-outer graph embedding and the complexity of the DNA reporter strand problem. (English) Zbl 1425.68310 Theor. Comput. Sci. 785, 117-127 (2019). MSC: 68R10 05C10 68Q05 68Q17 92D20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Abrahão, Felipe S.; Wehmuth, Klaus; Ziviani, Artur Algorithmic networks: central time to trigger expected emergent open-endedness. (English) Zbl 1423.68222 Theor. Comput. Sci. 785, 83-116 (2019). MSC: 68Q30 05C82 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Waldmajer, Jacek; Bonikowski, Zbigniew; Sakowski, Sebastian Theory of tailor automata. (English) Zbl 1423.68268 Theor. Comput. Sci. 785, 60-82 (2019). MSC: 68Q45 68Q05 92D20 × Cite Format Result Cite Review PDF Full Text: DOI
Breik, Keenan; Thachuk, Chris; Heule, Marijn; Soloveichik, David Computing properties of stable configurations of thermodynamic binding networks. (English) Zbl 1423.68164 Theor. Comput. Sci. 785, 17-29 (2019). MSC: 68Q05 68Q17 92C45 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
van Dam, Wim (ed.); Mančinska, Laura (ed.) 14th conference on the theory of quantum computation, communication and cryptography, TQC 2019, College Park, Maryland, USA, June 3–5, 2019. Proceedings. (English) Zbl 1414.68010 LIPIcs – Leibniz International Proceedings in Informatics 135. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik (ISBN 978-3-95977-112-2). xiii, 10 articles, not consecutively paged, electronic only, open access (2019). MSC: 68-06 81-06 68Q05 81P68 81P94 00B25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Kossak, Roman Book review of: M. D. Davis, The universal computer. The road from Leibniz to Turing. 3rd edition. (English) Zbl 1416.00011 Math. Intell. 41, No. 2, 78-79 (2019). MSC: 00A17 68-03 01A50 01A55 01A60 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Bhatia, Amandeep Singh; Kumar, Ajay On the power of two-way multihead quantum finite automata. (English) Zbl 1418.81016 RAIRO, Theor. Inform. Appl. 53, No. 1-2, 19-35 (2019). MSC: 81P68 68Q05 68Q10 68Q12 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI
Geffert, Viliam Unary coded PSPACE-complete languages in \(\mathrm{ASPACE}(\log\log n)\). (English) Zbl 1425.68199 Theory Comput. Syst. 63, No. 4, 688-714 (2019). MSC: 68Q45 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Schweller, Robert; Winslow, Andrew; Wylie, Tim Nearly constant tile complexity for any shape in two-handed tile assembly. (English) Zbl 1425.68115 Algorithmica 81, No. 8, 3114-3135 (2019). MSC: 68Q05 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI
Bailly, Raphaël; Rabusseau, Guillaume; Denis, François Recognizable series on graphs and hypergraphs. (English) Zbl 1423.68162 J. Comput. Syst. Sci. 104, 58-81 (2019). MSC: 68Q05 05C65 15A69 × Cite Format Result Cite Review PDF Full Text: DOI
Kol, Gillat; Moran, Shay; Shpilka, Amir; Yehudayoff, Amir Approximate nonnegative rank is equivalent to the smooth rectangle bound. (English) Zbl 1423.68194 Comput. Complexity 28, No. 1, 1-25 (2019). MSC: 68Q17 68Q05 68Q10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Wu, Tingfang; Pan, Linqiang; Alhazov, Artiom Computation power of asynchronous spiking neural P systems with polarizations. (English) Zbl 1423.68181 Theor. Comput. Sci. 777, 474-489 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
van Leeuwen, Jan; Wiedermann, Jiří Question answering by humans and machines: a complexity-theoretic view. (English) Zbl 1423.68375 Theor. Comput. Sci. 777, 464-473 (2019). MSC: 68T01 68Q05 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Orellana-Martín, David; Valencia-Cabrera, Luis; Riscos-Núñez, Agustín; Pérez-Jiménez, Mario J. A path to computational efficiency through membrane computing. (English) Zbl 1423.68176 Theor. Comput. Sci. 777, 443-453 (2019). MSC: 68Q05 68Q10 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI Link
Okubo, Fumiya; Yokomori, Takashi Decomposition and factorization of chemical reaction transducers. (English) Zbl 1425.68112 Theor. Comput. Sci. 777, 431-442 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Kimoto, Nobuya; Komiya, Ken; Fujimoto, Kenzo; Kobayashi, Satoshi Monotonically controlling right linear grammars with unknown behaviors to output a target string. (English) Zbl 1423.68232 Theor. Comput. Sci. 777, 387-408 (2019). MSC: 68Q42 68Q05 92D20 × Cite Format Result Cite Review PDF Full Text: DOI
Bernot, G.; Comet, J.-P.; Khalis, Z.; Richard, A.; Roux, O. A genetically modified Hoare logic. (English) Zbl 1423.68163 Theor. Comput. Sci. 765, 145-157 (2019). MSC: 68Q05 03B70 92C42 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Shin, Seung Woo; Thachuk, Chris; Winfree, Erik Verifying chemical reaction network implementations: a pathway decomposition approach. (English) Zbl 1423.68292 Theor. Comput. Sci. 765, 67-96 (2019). MSC: 68Q60 68Q05 68Q85 92C40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cardelli, Luca; Tribastone, Mirco; Tschaikowski, Max; Vandin, Andrea Comparing chemical reaction networks: a categorical and algorithmic perspective. (English) Zbl 1423.68165 Theor. Comput. Sci. 765, 47-66 (2019). MSC: 68Q05 68Q85 92C40 92C42 × Cite Format Result Cite Review PDF Full Text: DOI Link
Feret, Jérôme (ed.); Paulevé, Loïc (ed.); Šafránek, David (ed.) Preface. (English) Zbl 1423.68022 Theor. Comput. Sci. 765, 1-2 (2019). MSC: 68-06 68Q05 68Q10 68Q60 92C40 92C42 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
McQuillan, Ian (ed.); Seki, Shinnosuke (ed.) Unconventional computation and natural computation. 18th international conference, UCNC 2019, Tokyo, Japan, June 3–7, 2019. Proceedings. (English) Zbl 1410.68017 Lecture Notes in Computer Science 11493. Cham: Springer (ISBN 978-3-030-19310-2/pbk; 978-3-030-19311-9/ebook). xx, 287 p. (2019). MSC: 68-06 68Q05 68Q10 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Jiang, Suxia; Wang, Yanfeng; Xu, Jinbang; Xu, Fei The computational power of cell-like P systems with symport/antiport rules and promoters. (English) Zbl 1414.68029 Fundam. Inform. 164, No. 2-3, 207-225 (2019). MSC: 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Cooper, James; Nicolescu, Radu The Hamiltonian cycle and travelling salesman problems in cP systems. (English) Zbl 1414.68028 Fundam. Inform. 164, No. 2-3, 157-180 (2019). MSC: 68Q05 68Q17 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Carandang, Jym Paul; Cabarle, Francis George C.; Adorna, Henry Natividad; Hernandez, Nestine Hope S.; Martínez-del-Amor, Miguel Ángel Handling non-determinism in spiking neural P systems: algorithms and simulations. (English) Zbl 1414.68026 Fundam. Inform. 164, No. 2-3, 139-155 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Pan, Linqiang (ed.); Pérez-Jiménez, Mario J. (ed.); Zhang, Gexiang (ed.) Bio-inspired computing: theories and applications (BIC-TA 2017). Preface. (English) Zbl 1414.68006 Fundam. Inform. 164, No. 2-3, i-ii (2019). MSC: 68-06 68Q05 68Q10 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Pal, Suryakanta; Sahoo, Sudhakar; Nayak, Birendra Kumar Deterministic computing techniques for perfect density classification. (English) Zbl 1419.68065 Int. J. Bifurcation Chaos Appl. Sci. Eng. 29, No. 5, Article ID 1950064, 11 p. (2019). MSC: 68Q80 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Kjos-Hanssen, Bjørn Only human. Book review of: B. J. Copeland (ed.) et al., The Turing guide. (English) Zbl 1414.00006 Notices Am. Math. Soc. 66, No. 4, 556-561 (2019). MSC: 00A17 68-06 68-01 68-03 01A60 01A70 68Q05 94A60 00B15 × Cite Format Result Cite Review PDF Full Text: DOI
Vitányi, Paul M. B. Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. (English) Zbl 1423.68180 Theor. Comput. Sci. 778, 78-80 (2019). Reviewer: Cristian S. Calude (Auckland) MSC: 68Q05 03D10 68Q30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Link
Dennunzio, Alberto; Formenti, Enrico; Manzoni, Luca; Porreca, Antonio E. Complexity of the dynamics of reaction systems. (English) Zbl 1422.68069 Inf. Comput. 267, 96-109 (2019). MSC: 68Q05 37B10 68Q17 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Gori, Roberta; Gruska, Damas; Milazzo, Paolo Studying opacity of reaction systems through formula based predictors. (English) Zbl 1412.68059 Fundam. Inform. 165, No. 3-4, 303-319 (2019). MSC: 68Q05 92C40 × Cite Format Result Cite Review PDF Full Text: DOI
Dutta, Soma; Jankowski, Andrzej; Rozenberg, Grzegorz; Skowron, Andrzej Linking reaction systems with rough sets. (English) Zbl 1412.68058 Fundam. Inform. 165, No. 3-4, 283-302 (2019). MSC: 68Q05 68T37 × Cite Format Result Cite Review PDF Full Text: DOI
Becker, Ruben; Bonifaci, Vincenzo; Karrenbauer, Andreas; Kolev, Pavel; Mehlhorn, Kurt Two results on slime mold computations. (English) Zbl 1422.68068 Theor. Comput. Sci. 773, 79-106 (2019). MSC: 68Q05 68W25 68W40 90C05 92D50 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Ito, Tsuyoshi; Jeffery, Stacey Approximate span programs. (English) Zbl 1421.68051 Algorithmica 81, No. 6, 2158-2195 (2019). MSC: 68Q12 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI Link
Porter, Christopher P. Three books on computability, with a special focus on Turing’s legacy. Essay review of: A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem. Book review of: R. Adams, An early history of recursive functions and computability from Gödel to Turing; B. J. Copeland (ed.) et al., Computability. Turing, Gödel, church, and beyond; G. Sommaruga and T. Strahm (ed.), Turing’s revolution. The impact of his ideas about computability. (English) Zbl 1417.00050 Hist. Math. 46, 88-95 (2019). MSC: 00A17 03-03 01A60 03Dxx 68Q05 01-06 01A70 03D15 68-03 68Q15 68Q17 00B15 68-06 03D10 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Song, Tao (ed.); Zheng, Pan (ed.); Wong, Mou Ling Dennis (ed.); Wang, Xun (ed.) Bio-inspired computing models and algorithms. (English) Zbl 1409.68006 Hackensack, NJ: World Scientific (ISBN 978-981-314-317-3/hbk; 978-981-3143-19-7/ebook). xvi, 282 p. (2019). MSC: 68-02 68Q05 68Q10 68T20 68W05 00B15 × Cite Format Result Cite Review PDF Full Text: DOI
Gopal, T. V. (ed.); Watada, Junzo (ed.) Theory and applications of models of computation. 15th annual conference, TAMC 2019, Kitakyushu, Japan, April 13–16, 2019. Proceedings. (English) Zbl 1408.68017 Lecture Notes in Computer Science 11436. Cham: Springer (ISBN 978-3-030-14811-9/pbk; 978-3-030-14812-6/ebook). xiv, 708 p. (2019). MSC: 68-06 68Q05 00B25 × Cite Format Result Cite Review PDF Full Text: DOI
Mazowiecki, Filip; Riveros, Cristian Copyless cost-register automata: structure, expressiveness, and closure properties. (English) Zbl 1421.68050 J. Comput. Syst. Sci. 100, 1-29 (2019). MSC: 68Q05 68Q10 68Q45 × Cite Format Result Cite Review PDF Full Text: DOI Link
Harsha, Prahladh; Srinivasan, Srikanth On polynomial approximations to \(\mathrm{AC}^0\). (English) Zbl 1421.68055 Random Struct. Algorithms 54, No. 2, 289-303 (2019). MSC: 68Q15 68Q05 68Q10 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Dolev, Shlomi; Garay, Juan A.; Gilboa, Niv; Kolesnikov, Vladimir; Kumaramangalam, Muni Venkateswarlu Perennial secure multi-party computation of universal Turing machine. (English) Zbl 1421.68047 Theor. Comput. Sci. 769, 43-62 (2019). MSC: 68Q05 68Q10 94A62 × Cite Format Result Cite Review PDF Full Text: DOI
Kozak, Adam; Głowacki, Tomasz; Formanowicz, Piotr A method for constructing artificial DNA libraries based on generalized de Bruijn sequences. (English) Zbl 1407.05206 Discrete Appl. Math. 259, 127-144 (2019). MSC: 05C78 68R10 68Q05 68Q10 92D20 × Cite Format Result Cite Review PDF Full Text: DOI
Adamatzky, Andrew (ed.); Akl, Selim G. (ed.); Sirakoulis, Georgios Ch. (ed.) From parallel to emergent computing. (English) Zbl 1411.68011 Boca Raton, FL: CRC Press (ISBN 978-1-138-05401-1/hbk; 978-1-351-68192-6/ebook). xx, 608 p. (2019). MSC: 68-06 68Mxx 68Q05 68Q10 68T20 68T40 00B15 × Cite Format Result Cite Review PDF Full Text: DOI Link
Luo, Yueguo; Tan, Haijun; Zhang, Ying; Jiang, Yun The computational power of timed P systems with active membranes using promoters. (English) Zbl 1417.68043 Math. Struct. Comput. Sci. 29, No. 5, 663-680 (2019). MSC: 68Q05 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Date, Prasanna; Patton, Robert; Schuman, Catherine; Potok, Thomas Efficiently embedding QUBO problems on adiabatic quantum computers. (English) Zbl 1417.81081 Quantum Inf. Process. 18, No. 4, Paper No. 117, 31 p. (2019). MSC: 81P68 68T05 68P10 03D10 68Q05 68Q12 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI Link
Wu, WanQing; Zhang, HuanGuo A quantum query algorithm for computing the degree of a perfect nonlinear Boolean function. (English) Zbl 1417.81104 Quantum Inf. Process. 18, No. 3, Paper No. 62, 13 p. (2019). MSC: 81P68 81P94 94A60 06B30 68Q17 68Q12 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Marsh, S.; Wang, J. B. A quantum walk-assisted approximate algorithm for bounded NP optimisation problems. (English) Zbl 1417.81095 Quantum Inf. Process. 18, No. 3, Paper No. 61, 18 p. (2019). MSC: 81P68 68Q12 68Q17 68Q05 81S25 60G50 65K10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Shang, Tao; Chen, Ran-yi-liu; Liu, Jian-wei On the obfuscatability of quantum point functions. (English) Zbl 1409.81039 Quantum Inf. Process. 18, No. 2, Paper No. 55, 16 p. (2019). MSC: 81P94 94A60 68Q05 68P25 94A62 81P68 × Cite Format Result Cite Review PDF Full Text: DOI
Matthes, Wolfgang Minimal machines. A contribution to the fundamentals of computer architecture. (Minimale Maschinen. Ein Beitrag zu den Grundlagen der Rechnerarchitektur.) (German) Zbl 1417.68001 Berlin: Logos Verlag (ISBN 978-3-8325-4776-9/pbk). iv, 474 p. (2019). Reviewer: Gottfried Vossen (Münster) MSC: 68-01 68-02 68M07 68Q05 × Cite Format Result Cite Review PDF
Cabessa, Jérémie; Finkel, Olivier Computational capabilities of analog and evolving neural networks over infinite input streams. (English) Zbl 1410.68120 J. Comput. Syst. Sci. 101, 86-99 (2019). MSC: 68Q05 68Q45 92B20 × Cite Format Result Cite Review PDF Full Text: DOI HAL
Chang, Yi-Jun; Pettie, Seth A time hierarchy theorem for the LOCAL model. (English) Zbl 1405.68116 SIAM J. Comput. 48, No. 1, 33-69 (2019). MSC: 68Q05 05C15 60C05 68Q10 68Q15 68Q25 68W15 68W20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Namasudra, Suyel; Deka, Ganesh Chandra; Bali, Rohan Applications and future trends of DNA computing. (English) Zbl 1403.68067 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 165-176 (2019). MSC: 68Q05 68P25 94A60 × Cite Format Result Cite Review PDF
Kumar, Awanish DNA computing algorithm. (English) Zbl 1403.68066 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 151-163 (2019). MSC: 68Q05 68T20 × Cite Format Result Cite Review PDF
Namasudra, Suyel; Devi, Debashree; Choudhary, Sandeep; Patan, Rizwan; Kallam, Suresh Security, privacy, trust, and anonymity. (English) Zbl 1403.68059 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 137-150 (2019). MSC: 68P25 68Q05 94A60 × Cite Format Result Cite Review PDF
Karthikeyan, Selvaraj; Rizwan, Patan; Balamurugan, Balusamy Taxonomy of security attacks in DNA computing. (English) Zbl 1403.68065 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 117-135 (2019). MSC: 68Q05 68M11 94A60 × Cite Format Result Cite Review PDF
Devi, Debashree Application of DNA computing in the cloud computing environment. (English) Zbl 1403.68021 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 95-115 (2019). MSC: 68M14 68Q05 × Cite Format Result Cite Review PDF
Patro, Kintaali Abhimanyu Kumar; Acharya, Bibhudendra Novel data encryption scheme using DNA computing. (English) Zbl 1403.68060 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 53-94 (2019). MSC: 68P25 68Q05 × Cite Format Result Cite Review PDF
Namasudra, Suyel Taxonomy of DNA-based security models. (English) Zbl 1403.68058 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 37-52 (2019). MSC: 68P25 68Q05 94A60 × Cite Format Result Cite Review PDF
Namasudra, Suyel; Deka, Ganesh Chandra Introduction of DNA computing in cryptography. (English) Zbl 1404.94101 Namasudra, Suyel (ed.) et al., Advances of DNA computing in cryptography. Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). 1-18 (2019). MSC: 94A60 68Q05 × Cite Format Result Cite Review PDF
Moschovakis, Yiannis N. Abstract recursion and intrinsic complexity. (English) Zbl 1412.03004 Lecture Notes in Logic 48. Cambridge: Cambridge University Press; Ithaca, NY: Association of Symbolic Logic (ASL) (ISBN 978-1-108-41558-3/hbk; 978-1-108-23423-8/ebook). vii, 243 p. (2019). Reviewer: Leon Harkleroad (Bowdoinham) MSC: 03-02 03D15 03D20 03D10 03D75 68-02 68Q17 68Q25 68Q05 68W40 × Cite Format Result Cite Review PDF Full Text: DOI
Namasudra, Suyel (ed.); Deka, Ganesh Chandra (ed.) Advances of DNA computing in cryptography. (English) Zbl 1400.68012 Boca Raton, FL: CRC Press (ISBN 978-0-8153-8532-5/hbk; 978-1-351-01140-2/ebook). xv, 181 p. (2019). MSC: 68-02 94-02 68P25 68Q05 94A60 00B15 × Cite Format Result Cite Review PDF Full Text: Link
Hofri, Micha; Mahmoud, Hosam M. Algorithmics of nonuniformity: tools and paradigms. (English) Zbl 1402.68004 Discrete Mathematics and its Applications. Boca Raton, FL: CRC Press (ISBN 978-1-4987-5071-4/hbk; 978-1-4987-5072-1/ebook). xix, 569 p. (2019). Reviewer: Irina Ioana Mohorianu (Oxford) MSC: 68-01 68-02 68P05 68P10 68Q05 68Q45 68Q87 68R05 68R10 68W01 68W05 × Cite Format Result Cite Review PDF Full Text: Link
Latkin, Ivan V. The complexity of the first-order theory of pure equality. arXiv:1907.04521 Preprint, arXiv:1907.04521 [math.LO] (2019). MSC: 03C40 03C07 03D15 68Q05 68Q15 68Q17 × Cite Format Result Cite Full Text: DOI arXiv
Marchenkov, S. S. On the complexity of polynomial recurrence sequences. (English. Russian original) Zbl 1423.68174 Probl. Inf. Transm. 54, No. 3, 258-262 (2018); translation from Probl. Peredachi Inf. 54, No. 3, 67-72 (2018). MSC: 68Q05 11B37 11Y55 68Q25 × Cite Format Result Cite Review PDF Full Text: DOI
Dimitrijevs, Maksims; Yakaryılmaz, Abuzer Uncountable classical and quantum complexity classes. (English) Zbl 1425.68126 RAIRO, Theor. Inform. Appl. 52, No. 2-4, 111-126 (2018). MSC: 68Q15 68Q05 68Q12 81P68 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Beier, Simon; Kutrib, Martin; Malcher, Andreas; Wendlandt, Matthias Diving into the queue. (English) Zbl 1423.68243 RAIRO, Theor. Inform. Appl. 52, No. 2-4, 89-110 (2018). MSC: 68Q45 68Q05 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI
Ciaffaglione, Alberto; Honsell, Furio; Lenisa, Marina; Scagnetto, Ivan The involutions-as-principal types/application-as-unification analogy. (English) Zbl 1416.03009 Barthe, Gilles (ed.) et al., LPAR-22. 22nd international conference on logic for programming, artificial intelligence and reasoning, Awassa, Ethiopia, November 17–21, 2018. Selected papers. Manchester: EasyChair. EPiC Ser. Comput. 57, 254-270 (2018). MSC: 03B40 68Q05 × Cite Format Result Cite Review PDF Full Text: DOI
Teh, Wen Chean Compositions of functions and permutations specified by minimal reaction systems. (English) Zbl 1415.68100 Int. J. Found. Comput. Sci. 29, No. 7, 1165-1179 (2018). MSC: 68Q05 92C37 92C40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Davidson, Joe; Michaelson, Greg Expressiveness, meanings and machines. (English) Zbl 1417.68031 Computability 7, No. 4, 367-394 (2018). MSC: 68N30 68N15 68Q05 68Q55 × Cite Format Result Cite Review PDF Full Text: DOI
Poças, Diogo; Zucker, Jeffery Analog networks on function data streams. (English) Zbl 1418.68093 Computability 7, No. 4, 301-322 (2018). MSC: 68Q05 03D78 35E20 68Q10 × Cite Format Result Cite Review PDF Full Text: DOI
Kuiper, Ruurd Book review of: K. Warwick and H. Shah, Turing’s imitation game. Conservations with the unknown. (Dutch) Zbl 1409.00032 Nieuw Arch. Wiskd. (5) 19, No. 1, 64 (2018). MSC: 00A17 68-01 03A05 68Q05 68T01 68T05 × Cite Format Result Cite Review PDF
Pan, Linqiang; Song, Bosheng; Valencia-Cabrera, Luis; Pérez-Jiménez, Mario J. The computational complexity of tissue P systems with evolutional symport/antiport rules. (English) Zbl 1407.68177 Complexity 2018, Article ID 3745210, 21 p. (2018). MSC: 68Q05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Bergstra, J. A.; Middelburg, C. A. Instruction sequences expressing multiplication algorithms. (English) Zbl 1424.68034 Sci. Ann. Comput. Sci. 28, No. 1, 39-66 (2018). MSC: 68N30 68Q05 68W05 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Sherstov, Alexander A. On multiparty communication with large versus unbounded error. (English) Zbl 1412.68061 Theory Comput. 14, Paper No. 22, 17 p. (2018). MSC: 68Q05 68Q10 68Q15 68Q17 94C10 × Cite Format Result Cite Review PDF Full Text: DOI
Chattopadhyay, Arkadev; Mande, Nikhil S. Separation of unbounded-error models in multi-party communication complexity. (English) Zbl 1414.68027 Theory Comput. 14, Paper No. 21, 23 p. (2018). MSC: 68Q05 68Q10 68Q15 68Q17 94C10 × Cite Format Result Cite Review PDF Full Text: DOI
Rao, Anup; Sinha, Makrand Simplified separation of information and communication. (English) Zbl 1412.68060 Theory Comput. 14, Paper No. 20, 29 p. (2018). MSC: 68Q05 68Q10 68Q17 68Q85 68Q87 × Cite Format Result Cite Review PDF Full Text: DOI
Williams, R. Ryan New algorithms and lower bounds for circuits with linear threshold gates. (English) Zbl 1410.68127 Theory Comput. 14, Paper No. 17, 25 p. (2018). MSC: 68Q05 68Q17 68Q25 68W40 94C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kayal, Neeraj; Saha, Chandan; Tavenas, Sébastien On the size of homogeneous and of depth-four formulas with low individual degree. (English) Zbl 1410.68125 Theory Comput. 14, Paper No. 16, 46 p. (2018). MSC: 68Q05 68Q17 × Cite Format Result Cite Review PDF Full Text: DOI
Baumeler, Ämin; Wolf, Stefan Computational tameness of classical non-causal models. (English) Zbl 1402.81082 Proc. R. Soc. Lond., A, Math. Phys. Eng. Sci. 474, No. 2209, Article ID 20170698, 13 p. (2018). MSC: 81P68 68Q05 68Q15 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Cairns, Hannah Some halting problems for abelian sandpiles are undecidable in dimension three. (English) Zbl 1403.68133 SIAM J. Discrete Math. 32, No. 4, 2636-2666 (2018). MSC: 68Q80 68Q05 68Q10 68Q17 91A43 × Cite Format Result Cite Review PDF Full Text: DOI arXiv