Zobrazeno 1 - 10
of 71
pro vyhledávání: '"Villagra, Marcos"'
Autor:
Mercado, Sergio, Villagra, Marcos
Publikováno v:
Discrete Mathematics, Algorithms and Applications 2021
We say that a square real matrix $M$ is \emph{off-diagonal nonnegative} if and only if all entries outside its diagonal are nonnegative real numbers. In this note we show that for any off-diagonal nonnegative symmetric matrix $M$, there exists a nonn
Externí odkaz:
http://arxiv.org/abs/2009.11133
A tromino tiling problem is a packing puzzle where we are given a region of connected lattice squares and we want to decide whether there exists a tiling of the region using trominoes with the shape of an L. In this work we study a slight variation o
Externí odkaz:
http://arxiv.org/abs/2007.12651
Spectral sparsification is a technique that is used to reduce the number of non-zero entries in a positive semidefinite matrix with little changes to its spectrum. In particular, the main application of spectral sparsification is to construct sparse
Externí odkaz:
http://arxiv.org/abs/2003.10612
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Díaz-Caro, Alejandro, Villagra, Marcos
In this paper, we introduce classically time-controlled quantum automata or CTQA, which is a reasonable modification of Moore-Crutchfield quantum finite automata that uses time-dependent evolution and a "scheduler" defining how long each Hamiltonian
Externí odkaz:
http://arxiv.org/abs/1807.05385
Autor:
Nakanishi, Masaki, Villagra, Marcos
In this work we study the space complexity of computable real numbers represented by fast convergent Cauchy sequences. We show the existence of families of trascendental numbers which are logspace computable, as opposed to algebraic irrational number
Externí odkaz:
http://arxiv.org/abs/1805.02572
Publikováno v:
Theoretical Computer Science 2020
We study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we identify restrictions to the problem where it either rem
Externí odkaz:
http://arxiv.org/abs/1710.04640
Autor:
Villagra, Marcos
The Gap-Hamming distance problem is the promise problem of deciding if the Hamming distance $h$ between two strings of length $n$ is greater than $a$ or less than $b$, where the gap $g=|a-b|\geq 1$ and $a$ and $b$ could depend on $n$. In this short n
Externí odkaz:
http://arxiv.org/abs/1705.09710
Autor:
Baran, Benjamin, Villagra, Marcos
Publikováno v:
Axioms 2019
In this work we present a quantum algorithm for multiobjective combinatorial optimization. We show how to map a convex combination of objective functions onto a Hamiltonian and then use that Hamiltonian to prove that the quantum adiabatic algorithm o
Externí odkaz:
http://arxiv.org/abs/1605.03152
Autor:
Villagra, Marcos, Yakaryılmaz, Abuzer
Publikováno v:
Natural Computing (2017)
In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by D\'iaz-Caro and Yakary{\i}lmaz \cite{DCY16A} referred as affine automata. First, we present efficient simulat
Externí odkaz:
http://arxiv.org/abs/1602.05432