Results 71 to 80 of about 20,200 (225)
Bounded Reachability for Temporal Logic over Constraint Systems [PDF]
, 2010 We present CLTLB(D), an extension of PLTLB (PLTL with both past and future operators) augmented with atomic formulae built over a constraint system D. Even for decidable constraint systems, satisfiability and Model Checking problem of such logic can be ...
Bersani, Marcello M. +5 more
core +2 more sources
The Boolean Satisfiability Problem
, 2020 The Boolean Satisfiability Problem is also the first problem proven to be NP-complete. A problem is NP-complete if it belongs to the set (or "class" if you prefer) of the hardest problems in NP-hardest in the sense that every problem ever exists in NP can be reduced to them. (Thus being able to solve a NP-complete problem is equivalent to being able to
openaire +1 more source
Advanced Physics Research, Volume 5, Issue 5, May 2026.This study demonstrates a versatile hardware platform using nano‐oscillators based on binary oxides for deterministic and probabilistic computing. By tailoring material physics, NbOx enables energy‐efficient synchronization for pattern recognition, while enhanced stochasticity in engineered SiOx provides robust entropy for p‐bits to solve complex ...
Jihyun Kim +3 more
wiley +1 more source
Boolean lexicographic optimization: algorithms & applications [PDF]
, 2011 Multi-Objective Combinatorial Optimization (MOCO) problems find a wide range of practical application problems, some of which involving Boolean variables and constraints.
Argelich Romà, Josep +3 more
core +1 more source
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
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
Exploration of Chemical Space Through Automated Reasoning
Angewandte Chemie, Volume 137, Issue 6, February 3, 2025.In this work we develop an automated reasoning method, COMGEN to determine valid compositions for a given set of domain expert defined constraints. We demonstrate the method in an automated workflow with crystal structure prediction and properties models to locate and predict new potential Li‐ion solid state electrolytes.
Judith Clymo +7 more
wiley +2 more sources
A Constructive Quantum Lov\'asz Local Lemma for Commuting Projectors [PDF]
, 2013 The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors.
Arad, Itai, Sattath, Or
core
Enhancing Quantum Approximate Optimization Algorithm Through Manifold Optimization
Quantum Engineering, Volume 2026, Issue 1, 2026.We propose the models of Riemannian manifold optimization techniques to enhance the performance of the quantum approximate optimization algorithm (QAOA) for combinatorial optimization problems on near‐term quantum devices. The approach leverages the intrinsic geometric structure of the problem domain, addressing the nonconvexity of the QAOA objective ...
Qingqing Yu +3 more
wiley +1 more source
Generating and Searching Families of FFT Algorithms [PDF]
, 2011 A fundamental question of longstanding theoretical interest is to prove the lowest exact count of real additions and multiplications required to compute a power-of-two discrete Fourier transform (DFT).
Haynal, Heidi, Haynal, Steve
core