Results 311 to 320 of about 872,020 (326)
Some of the next articles are maybe not open access.
Sparse recovery from quadratic equations, part II: hardness and incoherence
arXiv.orgWe study the square root bottleneck in the recovery of sparse vectors from quadratic equations. It is acknowledged that a sparse vector $ \mathbf x_0\in \mathbb{R}^n$, $\| \mathbf x_0\|_0 = k$ can in theory be recovered from as few as $O(k)$ generic ...
A. Cosse
semanticscholar +1 more source
General resolution of tseitin formulas is hard
1991G being a graph, we define its cyclomatic cohesion γ(G).Then,using Tseitin method [Tse 70], we construct a contradictory formula C(G) and prove our main theorem:
openaire +1 more source
The Generalized Soft-and-Hard Surface
30th European Microwave Conference, 2000, 2000The well-known soft-and-hard surface (SHS) condition is one example of the ideal boundary condition defined by vanishing of the normal component of the complex Poynting vector at the boundary. It is shown that more general ideal boundary condition leads to a generalised SHS (GSHS) boundary where the real special direction on the surface is replaced by ...
I.V. Lindell +2 more
openaire +1 more source
Annual Conference on Genetic and Evolutionary Computation, 2012
Erik Pitzer, A. Beham, M. Affenzeller
semanticscholar +1 more source
Erik Pitzer, A. Beham, M. Affenzeller
semanticscholar +1 more source
On generating random graphs with hard and soft constraints
International Journal of Computer Aided Engineering and Technology, 2022Mohamed Amine Omrani, Wady Naanaa
openaire +1 more source
Generic expression hardness results for primitive positive formula comparison
Information and Computation, 2013Hubie Chen, Matt Valeriote
exaly
The Semi-Generic Group Model and Applications to Pairing-Based Cryptography
Lecture Notes in Computer Science, 2010Andy Rupp, Jäger Tibor
exaly
Automated Analysis of Cryptographic Assumptions in Generic Group Models
Journal of Cryptology, 2018Gilles Barthe +2 more
exaly