Results 101 to 110 of about 18,245 (221)
Small, Volume 22, Issue 59, 22 October 2026.Scaling nanofluidic channel geometries to sub‐200 nm is demonstrated to suppress junction guiding errors in network‐based biocomputing. The resulting increase in path fidelity enables experimental solution of Exact Cover instances with more than 33 million possible solutions, establishing a new benchmark for network‐based biocomputing. ABSTRACT Network‐
Eugene Christo V R +8 more
wiley +1 more source
Algorithms for four variants of the exact satisfiability problem
, 2004 We present four polynomial space and exponential time algorithms for variants of the EXACT SATISFIABILITY problem. First, an O(1.1120n) (where n is the number of variables) time algorithm for the NP-complete decision problem of EXACT 3-SATISFIABILITY ...
Beigel, R., +2 more
core +1 more source
High Voltage, Volume 11, Issue 5, Page 1611-1634, October 2026.ABSTRACT Electric power systems are undergoing a fundamental transition from synchronous generator (SG)‐dominated systems to inverter‐based resource (IBR)‐dominated systems. Lyapunov‐ and energy‐function‐based direct methods provide an effective way to estimate the stability region, also known as the region of attraction (ROA), and have become a ...
Yifan Zhang +5 more
wiley +1 more source
SMT-COMP: Satisfiability Modulo Theories Competition
, 2005 Decision procedures for checking satisfiability of logical formulas are crucial for many verification applications (e.g., [2, 6, 3]). Of particular recent interest are solvers for Satisfiability Modulo Theories (SMT).
Clark Barrett +2 more
core +1 more source
Advanced Electronic Materials, Volume 12, Issue 17, 7 September 2026.Ising machines are emerging as specialized hardware solvers for computationally hard optimization problems. This review examines five major platforms—digital CMOS, analog CMOS, emerging devices, coherent optics, and quantum systems—highlighting physics‐rooted advantages and shared bottlenecks in scalability and connectivity.
Hyunjun Lee, Joon Pyo Kim, Sanghyeon Kim
wiley +1 more source
Solving Error Correction for Large Data Sets as Propositional Satisfiability
, 2003 Encoding Information Reconstruction problems of different origins into Propositional Satisfiability ...
BRUNI, Renato
core
Orientations of Graphs With at Most One Directed Path Between Every Pair of Vertices
Journal of Graph Theory, Volume 113, Issue 1, Page 143-164, September 2026.ABSTRACT Given a graph G, we say that an orientation D of G is a KT orientation if, for all u , v ∈ V ( D ), there is at most one directed path (in any direction) between u and v. Graphs that admit such orientations have been used to construct graphs with large chromatic number and small clique number that served as counterexamples to various ...
Barbora Dohnalová +3 more
wiley +1 more source
Search Algorithms for Satisfiability Problems in Combinational Switching Circuits
, 1995 A number of tasks in computer-aided analysis of combinational circuits, including test pattern generation, timing analysis, delay fault testing and logic verification, can be viewed as particular formulations of the satisfiability problem (SAT).
João Paulo Marques da Silva +2 more
core
Learning From Satisfiability [PDF]
, 1997 A formalisation of concept-learning in logic is presented under the name learning from satisfiability. It generalizes learning from entailment as employed in inductive logic programming and learning from interpretations as used in attribute-value ...
Luc Dehaspe +3 more
core
New Journal of Physics, 2016 We present an exact quantum algorithm for solving the Exact Satisfiability problem, which belongs to the important NP-complete complexity class. The algorithm is based on an intuitive approach that can be divided into two parts: the first step consists ...
Salvatore Mandrà +2 more
doaj +1 more source