Results 151 to 160 of about 44,054 (190)
Network topology and interaction logic determine states it supports. [PDF]
NPJ Syst Biol ApplGedeon T.
europepmc +1 more source
A Process Algebraic Approach to Predict and Control Uncertainty in Smart IoT Systems for Smart Cities Based on Permissible Probabilistic Equivalence. [PDF]
Sensors (Basel)Song J, Karagiannis D, Lee M.
europepmc +1 more source
Formal methods for safety-critical machine learning: a systematic literature review. [PDF]
Front Artif IntellNewcomb A, Ochoa O.
europepmc +1 more source
Computing high-degree polynomial gradients in memory. [PDF]
Nat CommunBhattacharya T +8 more
europepmc +1 more source
Research on a Hybrid Scheduling Algorithm Based on Critical-Link Optimization for Large-Scale Time-Triggered Ethernet. [PDF]
Sensors (Basel)Zhu H, Li Z, Cheng J, Jin Z.
europepmc +1 more source
Routing and Scheduling in Time-Sensitive Networking by Evolutionary Algorithms. [PDF]
Biomimetics (Basel)Wang Z, Liao W, Xia X, Wang Z, Duan Y.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Approximating Satisfiable Satisfiability Problems
Algorithmica, 2000zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Efficient Temporal Satisfiability
Journal of Logic and Computation, 1992The complexity of testing satisfiability of almost all extant propositional logics of programs is \(NP\)-hard, because these logics subsume ordinary propositional logic. If the conjecture \(P\neq NP\) is true, it seems likely that the best deterministic decision procedure we could hope for is of exponential time complexity. This interesting paper gives
Emerson, E. Allen +2 more
openaire +2 more sources
Proceedings 38th Annual Symposium on Foundations of Computer Science, 2002
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Paturi, Ramamohan +2 more
openaire +2 more sources
Summary: In this paper, we prove a lemma that shows how to encode satisfying solutions of a \(k\)-CNF (boolean formulae in conjunctive normal form with at most \(k\) literals per clause) succinctly. Using this lemma, which we call the satisfiability coding lemma, we prove tight lower bounds on depth-3 circuits and improved upper bounds for the \(k ...
Paturi, Ramamohan +2 more
openaire +2 more sources