Results 41 to 50 of about 1,003,788 (328)

Quantum algorithms and lower bounds for convex optimization [PDF]

open access: yesQuantum, 2020
While recent work suggests that quantum computers can speed up the solution of semidefinite programs, little is known about the quantum complexity of more general convex optimization.
Shouvanik Chakrabarti   +3 more
doaj   +1 more source

Special Issue “New Frontiers in Parameterized Complexity and Algorithms”: Foreward by the Guest Editors

open access: yesAlgorithms, 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

The global rate of convergence for optimal tensor methods in smooth convex optimization [PDF]

open access: yesКомпьютерные исследования и моделирование, 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

New Lower Bounds for Constant Dimension Codes [PDF]

open access: yes, 2013
This paper provides new constructive lower bounds for constant dimension codes, using different techniques such as Ferrers diagram rank metric codes and pending blocks.
Silberstein, Natalia   +1 more
core   +1 more source

GRAV3D Validation using Generalized Cross-Validation (GCV) Algorithm by Lower Bounds Approach for 3D Gravity Data Inversion

open access: yesScientific Journal of Informatics, 2018
The completion of gravitational data inversion results in a smooth recovered model. GRAV3D is one software that can be used to solve 3D inversion problems of gravity data.
Mochamad Aryono Adhi   +3 more
doaj   +1 more source

Consistency of circuit lower bounds with bounded theories [PDF]

open access: yesLogical Methods in Computer Science, 2020
Proving that there are problems in $\mathsf{P}^\mathsf{NP}$ that require boolean circuits of super-linear size is a major frontier in complexity theory. While such lower bounds are known for larger complexity classes, existing results only show that the ...
Jan Bydzovsky   +2 more
doaj   +1 more source

Classical Lower Bounds from Quantum Upper Bounds [PDF]

open access: yes2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS), 2018
46 pages; to appear at FOCS ...
Ben-David, Shalev   +3 more
openaire   +2 more sources

Revealing the structure of land plant photosystem II: the journey from negative‐stain EM to cryo‐EM

open access: yesFEBS Letters, EarlyView.
Advances in cryo‐EM have revealed the detailed structure of Photosystem II, a key protein complex driving photosynthesis. This review traces the journey from early low‐resolution images to high‐resolution models, highlighting how these discoveries deepen our understanding of light harvesting and energy conversion in plants.
Roman Kouřil
wiley   +1 more source

Lower bounds for boxicity

open access: yesCombinatorica, 2014
20 ...
Adiga, Abhijin   +2 more
openaire   +4 more sources

Lower bounds on geometric Ramsey functions

open access: yes, 2014
We continue a sequence of recent works studying Ramsey functions for semialgebraic predicates in $\mathbb{R}^d$. A $k$-ary semialgebraic predicate $\Phi(x_1,\ldots,x_k)$ on $\mathbb{R}^d$ is a Boolean combination of polynomial equations and inequalities ...
Eliáš, Marek   +3 more
core   +1 more source

Home - About - Disclaimer - Privacy