Results 1 to 10 of about 156,901 (262)
Eliminating Nonvalue-Added Tasks in Health Care: Artificial Intelligence in the Orthopedic Office [PDF]
Journal of Hand Surgery Global OnlinePurpose: This study examines the efficiency and proof-of-concept use of a generative artificial intelligence (AI) documentation prototype, evaluating whether it can produce usable notes and estimating its potential time advantage compared with physician ...
Thomas Doss, BA +7 more
doaj +2 more sources
A Finite-Model-Theoretic View on Propositional Proof Complexity [PDF]
Logical Methods in Computer Science, 2022 We establish new, and surprisingly tight, connections between propositional proof complexity and finite model theory. Specifically, we show that the power of several propositional proof systems, such as Horn resolution, bounded-width resolution, and the ...
Erich Grädel +3 more
doaj +1 more source
Pebble Games, Proof Complexity, and Time-Space Trade-offs [PDF]
Logical Methods in Computer Science, 2013 Pebble games were extensively studied in the 1970s and 1980s in a number of different contexts. The last decade has seen a revival of interest in pebble games coming from the field of proof complexity. Pebbling has proven to be a useful tool for studying
Jakob Nordstrom
doaj +1 more source
On the relative proof complexity of deep inference via atomic flows [PDF]
Logical Methods in Computer Science, 2015 We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore ...
Anupam Das
doaj +1 more source
Sublogarithmic uniform Boolean proof nets [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Using a proofs-as-programs correspondence, Terui was able to compare two models of parallel computation: Boolean circuits and proof nets for multiplicative linear logic. Mogbil et. al.
Clément Aubert
doaj +1 more source
Gravitation from optimized computation: Einstein and beyond
Journal of High Energy Physics, 2023 A new principle in quantum gravity, dubbed spacetime complexity, states that gravitational physics emerges from spacetime seeking to optimize the computational cost of its quantum dynamics.
Rafael Carrasco +3 more
doaj +1 more source
A System of Interaction and Structure III: The Complexity of BV and Pomset Logic [PDF]
Logical Methods in Computer Science, 2023 Pomset logic and BV are both logics that extend multiplicative linear logic (with Mix) with a third connective that is self-dual and non-commutative. Whereas pomset logic originates from the study of coherence spaces and proof nets, BV originates from ...
Lê Thành Dũng Nguyên +1 more
doaj +1 more source
Certified Context-Free Parsing: A formalisation of Valiant's Algorithm in Agda [PDF]
Logical Methods in Computer Science, 2016 Valiant (1975) has developed an algorithm for recognition of context free languages. As of today, it remains the algorithm with the best asymptotic complexity for this purpose.
Jean-Philippe Bernardy, Patrik Jansson
doaj +1 more source
Shielding Probabilistically Checkable Proofs: Zero-Knowledge PCPs from Leakage Resilience
Entropy, 2022 Probabilistically Checkable Proofs (PCPs) allows a randomized verifier, with oracle access to a purported proof, to probabilistically verify an input statement of the form “x∈L” by querying only a few proof bits.
Mor Weiss
doaj +1 more source
ZKFERP:Universal and Efficient Range Proof Scheme with Constant Computational Cost [PDF]
Jisuanji kexue, 2022 The decentralization of blockchain can easily lead to the leakage of users’ private data at the transaction layer,which in turn leads to information security issues.The zero-knowledge range proof is designed to confidentially verify that the transaction ...
LI Yi-cong, ZHOU Kuan-jiu, WANG Zi-zhong, XU Lin
doaj +1 more source