Results 31 to 40 of about 74,857 (256)
Hamming Approximation of NP Witnesses [PDF]
, 2012 Given a satisfiable 3-SAT formula, how hard is it to find an assignment to the variables that has Hamming distance at most n/2 to a satisfying assignment? More generally, consider any polynomial-time verifier for any NP-complete language.
Sheldon, Daniel, Young, Neal E.
core +3 more sources
Communication Complexity of Computing the Hamming Distance [PDF]
SIAM Journal on Computing, 1986 Let \(x,y\in \{0,1\}^ n\). Persons A and B are given x and y respectively. They communicate in order that both find the Hamming distance \(d^ n_ H(x,y)\). Three communication models, viz, deterministic, \(\epsilon\)-error and \(\epsilon\)-randomized, are considered.
Pang, King F., El Gamal, Abbas
openaire +1 more source
Power analysis attack of HMAC based on SM3
Tongxin xuebao, 2016 The current power analysis attack of HMAC based on SM3 applies only to the object,on which there is the Hamming weight and Hamming distance information leakage at the same time.there is only a single information leakage mode on the attack object,then the
Zhi-bo DU +3 more
doaj +2 more sources
Unsupervised Ensemble Hashing: Boosting Minimum Hamming Distance
IEEE Access, 2020 Hashing aims at learning discriminative binary codes of high-dimensional data for the approximate nearest neighbor searching. However, the distance ranking obtained by traditional methods is not optimum in the Hamming space, and it degrades the ...
Yufei Zha +3 more
doaj +1 more source
Matching Patterns with Variables under Hamming Distance
, 2021 A pattern $ $ is a string of variables and terminal letters. We say that $ $ matches a word $w$, consisting only of terminal letters, if $w$ can be obtained by replacing the variables of $ $ by terminal words. The matching problem, i.e., deciding whether a given pattern matches a given word, was heavily investigated: it is NP-complete in general ...
Gawrychowski, Paweł +2 more
openaire +4 more sources
On Robust Colorings of Hamming-Distance Graphs [PDF]
The Electronic Journal of Combinatorics, 2018 $H_q(n,d)$ is defined as the graph with vertex set $\mathbb{Z}_q^n$ and where two vertices are adjacent if their Hamming distance is at least $d$. The chromatic number of these graphs is presented for various sets of parameters $(q,n,d)$. For the $4$-colorings of the graphs $H_2(n,n-1)$ a notion of robustness is introduced. It is based on the tolerance
Harney, Isaiah, Gluesing-Luerssen, Heide
openaire +3 more sources
Controlled random tests with limited Hamming distance
InformatikaObjectives. The problem of constructing controlled random tests with a fixed minimum Hamming distance is solved. The limitations of classical approaches to generating test patterns based on enumeration of test pattern candidates are shown.
V. N. Yarmolik +3 more
doaj +1 more source
Detection Of Duplicate And Near-Duplicate Content For Web Crawlers
JISR on Computing, 2015 There is an abundance of duplicated web documents on the internet. For example, two documents online could be very similar to each other except for a very small portion, such as URLs and advertisements.
Hadi Hussain Khan, Husnain Mansoor Ali
doaj +1 more source
Fuzzy Information and Engineering, 2023 In this paper, we used the definition of fuzzy vector spaces and fuzzy subsets in combination in order to define fuzzy codes over a fuzzy vector space.
Mezgebu Manmekto Gereme +2 more
doaj +1 more source
Error Tree: A Tree Structure for Hamming & Edit Distances & Wildcards Matching
, 2015 Error Tree is a novel tree structure that is mainly oriented to solve the approximate pattern matching problems, Hamming and edit distances, as well as the wildcards matching problem.
Al-Okaily, Anas
core +1 more source