Results 101 to 110 of about 12,229,216 (240)
Engineering Reports, Volume 8, Issue 2, February 2026.Quantum computing techniques such as Quantum Annealing and Quadratic Unconstrained Binary Optimization are effectively solving NP‐hard problems in operations management and research, particularly in logistics, manufacturing, and finance. This study maps these applications to present a framework for future adoption across industries. ABSTRACT This study
Daniel Bouzon Nagem Assad +3 more
wiley +1 more source
The addition of temporal neighborhood makes the logic of prefixes and sub-intervals EXPSPACE-complete [PDF]
Logical Methods in Computer ScienceA classic result by Stockmeyer gives a non-elementary lower bound to the emptiness problem for star-free generalized regular expressions. This result is intimately connected to the satisfiability problem for interval temporal logic, notably for formulas ...
L. Bozzelli +3 more
doaj +1 more source
Advanced Intelligent Systems, Volume 8, Issue 1, January 2026.This perspective article considers what computations optical computing can and should enable. Focusing upon free‐space optical computing, it argues that a codesign approach whereby materials, devices, architectures, and algorithms are simultaneously optimized is needed.
Prasad P. Iyer +6 more
wiley +1 more source
On Relaxation Polytope of 3-satisfiability Problem
Моделирование и анализ информационных систем, 2007 The properties of a polytope associated with the 3-satisfiability problem are investigated. Particularly, we prove that values of its vertice coordinates can be represented by fractions with arbitrarily large denominators.
B. V. Uryvaev
doaj
Combining solutions of the optimum satisfiability problem using evolutionary tunneling
Mendel, 2020 The optimum satisfiability problem involves determining values for Boolean variables to satisfy a Boolean expression, while maximizing the sum of coefficients associated with the variables chosen to be true.
Rodrigo Ferreira da Silva +2 more
doaj +1 more source
Satisfiability threshold for random regular NAE-SAT
, 2013 We consider the random regular $k$-NAE-SAT problem with $n$ variables each appearing in exactly $d$ clauses. For all $k$ exceeding an absolute constant $k_0$, we establish explicitly the satisfiability threshold $d_*=d_*(k)$. We prove that for $dd_*$ the
Ding, Jian, Sly, Allan, Sun, Nike
core +1 more source
The complexity of minimal satisfiability problems
Information and Computation, 2001 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Kirousis, Lefteris M. +1 more
openaire +2 more sources
LIMA: Local and Lightweight Mutual Authentication for VANETs
IET Intelligent Transport Systems, Volume 20, Issue 1, January/December 2026.This work presents LIMA, a lightweight local authentication protocol for VANETs. It is a SAE J2735 compliant certificateless vehicle authentication that eliminates traditional PKI dependencies while providing geographic zone‐based security and time‐based attribute control.
Munkenyi Mukhandi +2 more
wiley +1 more source
Impact of System‐Model Mismatch in Fourier Ptychographic Microscopy
Advanced Photonics Research, Volume 6, Issue 12, December 2025.This study investigates the robustness of Fourier ptychography microscope (FPM) reconstruction algorithms across various scenarios, each representing challenges encountered in practical FPM experiments, and deduces the extent to which FPM can provide diffraction‐limited resolution under the influence of various sources of error.
Tuo Yin +4 more
wiley +1 more source
Complexity of Generalized Satisfiability Counting Problems
Information and Computation, 1996 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Creignou, Nadia, Hermann, Miki
openaire +2 more sources