Results 111 to 120 of about 460,881 (203)

Metrological Characterization of Optical Measuring System for Hardness Indenters

, 2002
The verification of the geometry of Rockwell indenters has been widely studied in the past and, at the present, it is one of the most important tasks (in the uncertainty budget of hardness measurements) in discussion in many international organizations ...
ORIGLIA C., AFFRI R, Desogus S., Perteghella D., DESOGUS S, GERMAK, ALESSANDRO FRANCO LIDIA, Affri R., PERTEGHELLA D, Barbato G., BARBATO G   +9 more
core  

Tropical cryptography III: Digital signatures

Journal of Mathematical Cryptology
We use tropical algebras as platforms for a very efficient digital signature protocol. Security relies on computational hardness of factoring one-variable tropical polynomials; this problem is known to be NP-hard.
Chen Jiale, Grigoriev Dima, Shpilrain Vladimir   +2 more
doaj   +1 more source

Mechanical linkage design and NP-hardness

, 2014
International audienceWe prove the NP-hardness of two fundamental problems in mechanism design. Given a set of rigid parts and prescribed joints, the first problem consists in deciding whether there exists an assembly of these parts matching the link ...
Lieutier, André, Rameau, Jean-François
core   +1 more source

An NP-hard generalization of Nim

CoRR
A new combinatorial game is given. It generalizes both Substraction and Nim. It is proved the computation of Nash equilibrium points in this new game is NP-hard.
openaire   +3 more sources

Space-Time Assumptions Behind NP-Hardness of Propositional Satisfiability [PDF]

, 2013
For some problems, we know feasible algorithms for solving them. Other computational problems (such as propositional satisfiability) are known to be NP-hard, which means that, unless P=NP (which most computer scientists believe to be impossible), no ...
Kreinovich, Vladik, Kosheleva, Olga
core   +1 more source

Maintaining the Giant Component in Networks With Edge Weighted Augmentation Given Causal Failures

IEEE Access
Understanding the relationship between various nodes of a network is critical for building a robust and resilient network. Studying and understanding the causes of network failures is vital to prevent electric grid blackouts, mitigate supply chain ...
Zuyuan Zhang, Sridhar Radhakrishnan, Kash Barker, Andres D. Gonzalez   +3 more
doaj   +1 more source

Piecewise parametric structure in the pooling problem: from sparse strongly-polynomial solutions to NP-hardness. [PDF]

J Glob Optim, 2018
Baltean-Lugojan R, Misener R.
europepmc   +1 more source

Optimizing compilation of error correction codes for 2×n quantum dot arrays and its NP hardness

Physical Review Research
The ability to physically move qubits within a register allows the design of hardware-specific error correction codes, which can achieve fault tolerance while respecting other constraints.
Anthony Micciche, Feroz Ahmed Mian, Anasua Chatterjee, Andrew McGregor, Stefan Krastanov   +4 more
doaj   +1 more source

Approximation and Hardness: Beyond P and NP [PDF]

, 2019
The theory of NP-hardness of approximation has led to numerous tight characterizations of approximability of hard combinatorial optimization problems. Nonetheless, there are many fundamental problems which are out of reach for these techniques, such as ...
Manurangsi, Pasin
core  

Electrodeposited Bi₂Te₃-carbon black nanocomposites with enhanced thermoelectric and mechanical properties. [PDF]

iScience
Samat KF, Alias MA, Ikhwan Che Azman MA, Jali MH, Van Toan N, Ono T.   +5 more
europepmc   +1 more source