Results 21 to 30 of about 96,047 (264)
The global rate of convergence for optimal tensor methods in smooth convex optimization [PDF]
Компьютерные исследования и моделирование, 2018 In this work we consider Monteiro - Svaiter accelerated hybrid proximal extragradient (A-HPE) framework and accelerated Newton proximal extragradient (A-NPE) framework.
Alexander Vladimirovich Gasnikov +4 more
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
Treewidth Lower Bounds with Brambles [PDF]
Algorithmica, 2005 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hans L. Bodlaender +2 more
openaire +5 more sources
Lower bounds for incidences with hypersurfaces
Discrete Analysis, 2016 Lower bounds for incidences with hypersurfaces, Discrete Analysis 2016:16, 14pp. A fundamental result in combinatorial geometry, the Szemerédi-Trotter theorem, states that among any $n$ points and $m$ lines in $\mathbb R^2$ there can be at most $O((mn)^{
Adam Sheffer
doaj +1 more source
Algorithms, 2020 This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra +2 more
doaj +1 more source
A Lower Bound for Scheduling Mechanisms [PDF]
Algorithmica, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
George Christodoulou 0001 +2 more
openaire +7 more sources
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
On lower bounds for the Kirchhoff index [PDF]
Kragujevac Journal of Science, 2017 Let G be a simple graph of order n ≥ 2 with m edges. Denote by d1 ≥ d2 ≥ · · · ≥ dn > 0 the sequence of vertex degrees and by μ1 ≥ μ2 ≥ · · · ≥ μn−1 > μn = 0 the Laplacian eigenvalues of the graph G. Lower bounds for the Kirchhoff index, Kf(G) = n Σ −1 i=
Milovanović I.Ž. 0000-0003-2209-9606 +1 more
doaj +1 more source
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
Model Checking Lower Bounds for Simple Graphs [PDF]
Logical Methods in Computer Science, 2014 A well-known result by Frick and Grohe shows that deciding FO logic on trees involves a parameter dependence that is a tower of exponentials. Though this lower bound is tight for Courcelle's theorem, it has been evaded by a series of recent meta-theorems
Michael Lampis
doaj +1 more source