-
4441
Logical aspects of quantum computation
Published 2015“…<p>A fundamental component of theoretical computer science is the application of logic. Logic provides the formalisms by which we can model and reason about computational questions, and novel computational features provide new directions for the development of logic. …”
Thesis -
4442
-
4443
-
4444
-
4445
-
4446
Near-Optimal Quantum Algorithms for String Problems
Published 2023“…Specifically, we show that: Longest Common Substring can be solved by a quantum algorithm in $$\tilde{O}(n^{2/3})$$ O ~ ( n 2 / 3 ) time, improving upon the recent $$\tilde{O}(n^{5/6})$$ O ~ ( n 5 / 6 ) -time algorithm by Le Gall and Seddighin (in: Proceedings of the 13th innovations in theoretical computer science conference (ITCS 2022), pp 97:1–97:23, 2022. …”
Get full text
Article -
4447
-
4448
-
4449
-
4450
-
4451
Time-Dependent Changes in the Intestinal Microbiome of Gilts Exposed to Low Zearalenone Doses
Published 2019-05-01Get full text
Article -
4452
Cryptography from information loss
Published 2021“…Reductions between problems, the mainstay of theoretical computer science, efficiently map an instance of one problem to an instance of another in such a way that solving the latter allows solving the former.1 The subject of this work is “lossy” reductions, where the reduction loses some information about the input instance. …”
Get full text
Article -
4453
-
4454
Global Alignment of Molecular Sequences via Ancestral State Reconstruction
Published 2012Get full text
Get full text
Article -
4455
-
4456
Cryptography from information loss
Published 2022“…Reductions between problems, the mainstay of theoretical computer science, efficiently map an instance of one problem to an instance of another in such a way that solving the latter allows solving the former.1 The subject of this work is “lossy” reductions, where the reduction loses some information about the input instance. …”
Get full text
Article -
4457
Is FFT Fast Enough for Beyond 5G Communications? A Throughput-Complexity Analysis for OFDM Signals
Published 2022-01-01“…Thus, we show that FFT nullifies the OFDM throughput on <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> unless the <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula>-point discrete Fourier transform (DFT) problem verifies as <inline-formula> <tex-math notation="LaTeX">$\Omega (N)$ </tex-math></inline-formula>, which remains a “fascinating” open question in theoretical computer science. Also, because FFT demands <inline-formula> <tex-math notation="LaTeX">$N$ </tex-math></inline-formula> to be a power of two <inline-formula> <tex-math notation="LaTeX">$2^{i}$ </tex-math></inline-formula> (<inline-formula> <tex-math notation="LaTeX">$i>0$ </tex-math></inline-formula>), the spectrum widening leads to an exponential complexity on <inline-formula> <tex-math notation="LaTeX">$i$ </tex-math></inline-formula>, i.e. …”
Get full text
Article -
4458
Algorithmic biology of evolution and ecology
Published 2020“…<p>Any process can be seen as an algorithm; its power and its limits can then be analysed with the techniques of theoretical computer science. To analyse algorithms, we divide the world in two: the problem space that shapes what might happen and the dynamics of what does happen. …”
Thesis -
4459
From Permutation Patterns to the Periodic Table
Published 2023-05-01“…Pudwell, From Permutation Patterns to the Periodic Table, Notices of the American Mathematical Society, 67 994–1001.))Abstract: Permutation patterns is a burgeoning area of research with roots in enumerative combinatorics and theoretical computer science. This article first presents a brief overview of pattern avoidance and a survey of enumeration results that are standard knowledge within the field. …”
Get full text
Article -
4460