Results 41 to 50 of about 286,084 (291)
Proof complexity of positive branching programs [PDF]
Logical Methods in Computer ScienceWe investigate the proof complexity of systems based on positive branching programs, i.e. non-deterministic branching programs (NBPs) where, for any 0-transition between two nodes, there is also a 1-transition.
Anupam Das, Avgerinos Delkos
doaj +1 more source
Universal Communication, Universal Graphs, and Graph Labeling [PDF]
, 2019 We introduce a communication model called universal SMP, in which Alice and Bob receive a function f belonging to a family ?, and inputs x and y. Alice and Bob use shared randomness to send a message to a third party who cannot see f, x, y, or the shared
Harms, Nathaniel
core +2 more sources
Separations in Query Complexity Based on Pointer Functions [PDF]
, 2015 In 1986, Saks and Wigderson conjectured that the largest separation between deterministic and zero-error randomized query complexity for a total boolean function is given by the function $f$ on $n=2^k$ bits defined by a complete binary tree of NAND gates
Ambainis, Andris +5 more
core +3 more sources
Probabilistic communication complexity over the reals [PDF]
, 2007 Deterministic and probabilistic communication protocols are introduced in which parties can exchange the values of polynomials (rather than bits in the usual setting).
Grigoriev, Dima
core +4 more sources
, 2023 arXiv admin note: substantial text overlap with arXiv:2305.06093, arXiv:2304 ...
Ostonov, Azimkhon, Moshkov, Mikhail
openaire +2 more sources
Review of Kalah Game Research and the Proposition of a Novel Heuristic–Deterministic Algorithm Compared to Tree-Search Solutions and Human Decision-Making [PDF]
Informatics, 2020 The Kalah game represents the most popular version of probably the oldest board game ever—the Mancala game. From this viewpoint, the art of playing Kalah can contribute to cultural heritage. This paper primarily focuses on a review of Kalah history and on a survey of research made so far for solving and analyzing the Kalah game (and some other related ...
Libor Pekař +3 more
openaire +4 more sources
Advanced Science, EarlyView.Bacterial α‐diversity decreases, but stochasticity and community stability increase across the 15 m‐depth vertical profiles and along the degraded gradient within the active layer. The abundance and interaction of core taxa mainly control community stability in the active and permafrost layers, respectively.
Shengyun Chen +13 more
wiley +1 more source
Machine Learning for Green Solvents: Assessment, Selection and Substitution
Advanced Science, EarlyView.Environmental regulations have intensified demand for green solvents, but discovery is limited by Solvent Selection Guides (SSGs) that quantify solvent sustainability. Training a machine learning model on GlaxoSmithKline SSG, a database of sustainability metrics for 10,189 solvents, GreenSolventDB is developed. Integrated with Hansen solubility metrics,
Rohan Datta +4 more
wiley +1 more source
Three Problems for Decision Rule Systems from Closed Classes
AxiomsThe study of the relationships between DRSs (Decision Rule Systems) and DTs (Decision Trees) is of considerable interest in computer science. In this paper, we consider classes of DRSs that are closed under specific operations.
Kerven Durdymyradov, Mikhail Moshkov
doaj +1 more source
A Recursive IndetermTree Soft Set (RIT-Soft Set) for Dynamic and Uncertain Performance Evaluation in College Competitive Sports, [PDF]
Neutrosophic Sets and SystemsThis paper introduces the Recursive IndetermTree Soft Set (RIT-Soft Set), a novel extension of Soft Set Theory designed for performance evaluation in dynamic and uncertain environments.
Hai Yang, Cuijuan Lin
doaj +1 more source