Related papers: Does QRAT simulate IR-calc? QRAT simulation algori…
Computer simulations that demonstrate the valueof novel approaches are crucial to developing more flexibleand robust power systems operations with high penetrations ofrenewable energy at multiple geographic and temporal scales.However,…
Studies among other things, the question of whether a Lie algebra over Z/(p^k)Z lifts to one over Z/(p^(k+1))Z. An obstruction theory is developed and examples of Fp-Lie algebras which don't lift to Lie algebras over Z/p^2Z are discussed.…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
We prove the first genuine QBF proof size lower bounds for the proof system Merge Resolution (MRes [Olaf Beyersdorff et al., 2020]), a refutational proof system for prenex quantified Boolean formulas (QBF) with a CNF matrix. Unlike most QBF…
In this note we combine the advantages of the methods of Siegel-Baker-Coates and of Lang-Zagier for the computation of S-integral points on elliptic curves in Weierstrass normal form over the rationals. In this way we are able to overcome…
We show that adding recursion does not increase the total functions definable in the typed $\lambda\beta\eta$-calculus or the partial functions definable in the $\lambda\Omega$-calculus. As a consequence, adding recursion does not increase…
We show that for every positive $\epsilon > 0$, unless NP $\subset$ BPQP, it is impossible to approximate the maximum quadratic assignment problem within a factor better than $2^{\log^{1-\epsilon} n}$ by a reduction from the maximum label…
In our previous works we have classified real non-singular cubic hypersurfaces in the 5-dimensional projective space up to equivalence that includes both real projective transformations and continuous variations of coefficients preserving…
In this paper using a geometric model we show that there is a presilting complex over a finite dimensional algebra, which is not a direct summand of a silting complex.
It is known that the estimating equations for quantile regression (QR) can be solved using an EM algorithm in which the M-step is computed via weighted least squares, with weights computed at the E-step as the expectation of independent…
Quantum information science currently poses a troubling contradiction. It can be summarized as: (1) To factor efficiently, quantum computers must perform exponentially precise energy estimation. (2) Exponentially precise energy estimation…
Modern Deep Reinforcement Learning (RL) algorithms require estimates of the maximal Q-value, which are difficult to compute in continuous domains with an infinite number of possible actions. In this work, we introduce a new update rule for…
The article has been withdrawn by the author.
This work presents a novel approach to compute the eigenvalues of non-Hermitian matrices using an enhanced shifted QR algorithm. The existing QR algorithms fail to converge early in the case of non-hermitian matrices, and our approach shows…
We argue that the claim given in quant-ph/9801014 is untenable. The fallacy in the proof is a misinterpretation of the no-cloning theorem, which does not allow quantum jumps, specifically measurements.
In this paper we present an explicit counterexample of degree $n=7$, which shows that the conjecture proposed by Li et al. \cite{Li2013} regarding the first derivative bounds for rational B\'ezier curves is generally false. We further…
Merge Resolution (MRes [Beyersdorff et al. J. Autom. Reason.'2021]) is a recently introduced proof system for false QBFs. It stores the countermodels as merge maps. Merge maps are deterministic branching programs in which isomorphism…
We investigate the problem of factorization of large numbers on a quantum computer which we imagine to be realized within a linear ion trap. We derive upper bounds on the size of the numbers that can be factorized on such a quantum…
Let $E/\mathbb Q(t)$ be an elliptic curve and let $t_0 \in \mathbb Q$ be a rational number for which the specialization $E_{t_0}$ is an elliptic curve. Given a subgroup $M$ of $E(\mathbb Q(t))$ with mild conditions and $t_0 \in \mathbb Q$…
We consider the power of various quantum complexity classes with the restriction that states and operators are defined over a real, rather than complex, Hilbert space. It is well know that a quantum circuit over the complex numbers can be…