Results 31 to 40 of about 1,003,788 (328)
Quantum SDP-Solvers: Better upper and lower bounds [PDF]
Quantum, 2020 Brandão and Svore \cite{brandao2016QSDPSpeedup} recently gave quantum algorithms for approximately solving semidefinite programs, which in some regimes are faster than the best-possible classical algorithms in terms of the dimension $n$ of the problem ...
Joran van Apeldoorn +3 more
doaj +1 more source
A compact model for the home healthcare routing and scheduling problem
EURO Journal on Computational OptimizationHome healthcare has become more and more central in the last decades, due to the advantages it can bring to both healthcare institutions and patients. Planning activities in this context, however, presents significant challenges related to route planning
Roberto Montemanni +2 more
doaj +1 more source
Lower bounds for the energy of graphs
AKCE International Journal of Graphs and Combinatorics, 2018 Let G be a finite simple undirected graph with n vertices and m edges. The energy of a graph G , denoted by E ( G ) , is defined as the sum of the absolute values of the eigenvalues of G .
Akbar Jahanbani
doaj +2 more sources
Lower bounds on expressions dependent on functions φ(n), ψ(n) and σ(n), II [PDF]
Notes on Number Theory and Discrete MathematicsIn this paper we establish lower bounds on several expressions dependent on functions φ(n), ψ(n) and σ(n).
Stoyan Dimitrov
doaj +1 more source
Treewidth Lower Bounds with Brambles [PDF]
Algorithmica, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bodlaender, H.L. +2 more
openaire +5 more sources
Resolution Lower Bounds for Refutation Statements [PDF]
, 2019 For any unsatisfiable CNF formula we give an exponential lower bound on the size of resolution refutations of a propositional statement that the formula has a resolution refutation. We describe three applications.
Garlík, Michal
core +2 more sources
Lower Bound of the Complexity of Seven-Valued Functions in the Class of Polarized Polynomials
Известия Иркутского государственного университета: Серия "Математика", 2017 One of the directions of the investigation of functions over finite fields is the study of their representations, including polynomial ones. In the area of polynomial representations of functions the problem of estimating the complexity of such ...
A.S. Baliuk, A.S. Zinchenko
doaj +1 more source
Distribution-sensitive set multi-partitioning [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 Given a set $\mathcal{S}$ with real-valued members, associated with each member one of two possible types; a multi-partitioning of $\mathcal{S}$ is a sequence of the members of $\mathcal{S}$ such that if $x,y \in \mathcal{S}$ have different types and $x <
Amr Elmasry
doaj +1 more source
Arithmetic Circuit Lower Bounds via MaxRank [PDF]
, 2013 We introduce the polynomial coefficient matrix and identify maximum rank of this matrix under variable substitution as a complexity measure for multivariate polynomials. We use our techniques to prove super-polynomial lower bounds against several classes
A. Shpilka +7 more
core +1 more source
Input Redundancy for Parameterized Quantum Circuits
Frontiers in Physics, 2020 One proposal to utilize near-term quantum computers for machine learning are Parameterized Quantum Circuits (PQCs). There, input is encoded in a quantum state, parameter-dependent unitary evolution is applied, and ultimately an observable is measured. In
Francisco Javier Gil Vidal +2 more
doaj +1 more source