The Computational Complexity of Calculating Partition Functions of Optimal Medians With Hamming Distance

Advances in Applied Mathematics - United States
doi 10.1016/j.aam.2018.09.002
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

On the Hamming Distance Between Two Bent Functions

Prikladnaya diskretnaya matematika. Prilozhenie
2016English

Finite Element Heterogeneous Multiscale Methods With Near Optimal Computational Complexity

Multiscale Modeling and Simulation
AstronomySimulationComputer Science ApplicationsModelingEcological ModelingChemistryPhysics
2008English

HamHeat: A Fast and Simple Package for Calculating Hamming Distance From Multiple Sequence Data for Heatmap Visualization

2020English

Hamming Distance Computation in Unreliable Resistive Memory

IEEE Transactions on Communications
Electronic EngineeringElectrical
2018English

Low Computational Complexity Algorithm for Recognition Highly Corrupted QR Codes Based on Hamming-Lippmann Neural Network

Przeglad Elektrotechniczny
Electronic EngineeringElectrical
2019English

5d Partition Functions With a Twist

Journal of High Energy Physics
High Energy PhysicsNuclear
2018English

The Complexity of the List Partition Problem for Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2008English

Analyticity of Nekrasov Partition Functions

Communications in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2018English

Complexity and Approximation of Satisfactory Partition Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2005English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy