Results 261 to 270 of about 236,217 (313)

Blockchain-enabled identity management for IoT: a multi-layered defense against adversarial AI. [PDF]

Sci Rep
Usama M, Aziz A, Alasbali N, Alturki N, Hanif M, Rehman MU.   +5 more
europepmc   +1 more source

Transparent and Privacy-Preserving Mobile Crowd-Sensing System with Truth Discovery. [PDF]

Sensors (Basel)
Jia R, Ma J, You Z, Zhang M.
europepmc   +1 more source

Producing Proofs of Unsatisfiability with Distributed Clause-Sharing SAT Solvers. [PDF]

J Autom Reason
Michaelson D, Schreiber D, Heule MJH, Kiesl-Reiter B, Whalen MW.   +4 more
europepmc   +1 more source

Distributionally robust free energy principle for decision-making. [PDF]

Nat Commun
Shafiei A, Jesawada H, Friston K, Russo G.   +3 more
europepmc   +1 more source

Benchmarking the Base Randomization Algorithm as a Possible Tool for the Initial Step of Generating a Virtual RNA Aptamers Library. [PDF]

BioTech (Basel)
Mokgopa KP, Oloniiju SD, Lobb KA, Tshiwawa T.   +3 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

The Complexity of Propositional Proofs

Bulletin of Symbolic Logic, 1995
§1. Introduction. The classical propositional calculus has an undeserved reputation among logicians as being essentially trivial. I hope to convince the reader
A. Urquhart
semanticscholar   +4 more sources

Complexity of Hard-Core Set Proofs

computational complexity, 2011
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Chi-Jen Lu, Shi-Chun Tsai, H. Wu
semanticscholar   +2 more sources

Complexity of Finding Short Resolution Proofs

International Symposium on Mathematical Foundations of Computer Science, 1997
This paper discusses the problem of finding a shortest Resolution proof for a CNF formula of n variables. It is shown that if there is a polynomial-time (superpolynomial-time or subexponential time, respectively) approximation algorithm that finds a nearly shortest proof of length up to S + O(n d ), where S is the length of the shortest proof and d may
K. Iwama
semanticscholar   +2 more sources