Results 11 to 20 of about 4,950,636 (242)
Search Problems in Vector Spaces [PDF]
, 2014 We consider the following $q$-analog of the basic combinatorial search problem: let $q$ be a prime power and $\GF(q)$ the finite field of $q$ elements.
Héger, Tamás +2 more
core +2 more sources
Hardness Amplification of Optimization Problems [PDF]
, 2019 In this paper, we prove a general hardness amplification scheme for optimization problems based on the technique of direct products. We say that an optimization problem ?
Goldenberg, Elazar, Karthik C. S.,
core +2 more sources
Explicit constructions of RIP matrices and related problems [PDF]
, 2010 We give a new explicit construction of $n\times N$ matrices satisfying the Restricted Isometry Property (RIP). Namely, for some c>0, large N and any n satisfying N^{1-c} < n < N, we construct RIP matrices of order k^{1/2+c}.
Denka Kutzarova +10 more
core +6 more sources
Optimal Composition Ordering Problems for Piecewise Linear Functions [PDF]
, 2016 In this paper, we introduce maximum composition ordering problems. The input is $n$ real functions $f_1,\dots,f_n:\mathbb{R}\to\mathbb{R}$ and a constant $c\in\mathbb{R}$. We consider two settings: total and partial compositions.
Kawase, Yasushi +2 more
core +2 more sources
More eigenvalue problems of Nordhaus-Gaddum type [PDF]
, 2014 Let $G$ be a graph of order $n$ and let $\mu_{1}\left(G\right) \geq \cdots\geq\mu_{n}\left(G\right) $ be the eigenvalues of its adjacency matrix. This note studies eigenvalue problems of Nordhaus-Gaddum type.
Nikiforov, Vladimir, Yuan, Xiying
core +1 more source
On two problems in graph Ramsey theory [PDF]
, 2010 We study two classical problems in graph Ramsey theory, that of determining the Ramsey number of bounded-degree graphs and that of estimating the induced Ramsey number for a graph with a given number of vertices.
A. Thomason +36 more
core +5 more sources
Quantum search on structured problems [PDF]
, 1998 This paper shows how a basic property of unitary transformations can be used for meaningful computations. This approach immediately leads to search-type applications, where it improves the number of steps by a square-root - a simple minded search that ...
Grover, Lov K.
core +2 more sources
Worldlines on Orbifolds and the Fayet-Iliopoulos Term
, 2004 We adapt ``string-inspired'' worldline techniques to one-loop calculations on orbifolds, in particular on the $S^1/Z_2$ orbifold. Our method also allows for the treatment of brane-localized terms, or bulk-brane couplings.
Arkani-Hamed +15 more
core +2 more sources
General Stieltjes moment problems for rapidly decreasing smooth functions [PDF]
, 2017 We give (necessary and sufficient) conditions over a sequence $\left\{ f_{n}\right\} _{n=0}^{\infty}$ of functions under which every generalized Stieltjes moment problem \[ \int_{0}^{\infty} f_{n}(x)\phi(x)\mathrm{d} x=a_{n}, \ \ \ n\in\mathbb{N}, \] has
Estrada, Ricardo, Vindas, Jasson
core +2 more sources
N-particle N-level singlet states: Some properties and applications
, 2002 Three apparently unrelated problems which have no solution using classical tools are described: the "N-strangers," "secret sharing," and "liar detection" problems. A solution for each of them is proposed.
Adán Cabello +7 more
core +1 more source