Results 11 to 20 of about 1,420,577 (310)
Fast Bitwise Implementation of the Algebraic Normal Form Transform [PDF]
Serdica Journal of Computing, 2017 The representation of Boolean functions by their algebraic normal forms (ANFs) is very important for cryptography, coding theory and other scientific areas. The ANFs are used in computing the algebraic degree of S-boxes, some other cryptographic criteria
Bakoev, Valentin
core +2 more sources
Perfect Matching in Random Graphs is as Hard as Tseitin [PDF]
TheoretiCS, 2022 We study the complexity of proving that a sparse random regular graph on an odd number of vertices does not have a perfect matching, and related problems involving each vertex being matched some pre-specified number of times.
Per Austrin, Kilian Risse
doaj +1 more source
Deciding All Behavioral Equivalences at Once: A Game for Linear-Time--Branching-Time Spectroscopy [PDF]
Logical Methods in Computer Science, 2022 We introduce a generalization of the bisimulation game that finds distinguishing Hennessy-Milner logic formulas from every finitary, subformula-closed language in van Glabbeek's linear-time--branching-time spectrum between two finite-state processes.
Benjamin Bisping +2 more
doaj +1 more source
Frontiers in Physiology, 2022 Using a combination of respiratory gas exchange, infrared thermography, and blood glucose (BGL) analysis, we have investigated the impact of Capsicum annuum (C.
L. Van Schaik +6 more
semanticscholar +1 more source
Small Promise CSPs that reduce to large CSPs [PDF]
Logical Methods in Computer Science, 2022 For relational structures A, B of the same signature, the Promise Constraint Satisfaction Problem PCSP(A,B) asks whether a given input structure maps homomorphically to A or does not even map to B.
Alexandr Kazda, Peter Mayr, Dmitriy Zhuk
doaj +1 more source
Tractable Combinations of Temporal CSPs [PDF]
Logical Methods in Computer Science, 2022 The constraint satisfaction problem (CSP) of a first-order theory T is the computational problem of deciding whether a given conjunction of atomic formulas is satisfiable in some model of T.
Manuel Bodirsky +2 more
doaj +1 more source
Sustainability, 2022 Today, tourism plays an important role in the economic and financial development of countries, and its impact is greater than ever. Therefore, for sustainable economic and financial growth and well-planned development, public and private investments ...
M. Tase, Enkeleda Lulaj
semanticscholar +1 more source
Simplified Algorithmic Metatheorems Beyond MSO: Treewidth and Neighborhood Diversity [PDF]
Logical Methods in Computer Science, 2019 This paper settles the computational complexity of model checking of several extensions of the monadic second order (MSO) logic on two classes of graphs: graphs of bounded treewidth and graphs of bounded neighborhood diversity.
Dušan Knop +3 more
doaj +1 more source
On the Monadic Second-Order Transduction Hierarchy [PDF]
Logical Methods in Computer Science, 2010 We compare classes of finite relational structures via monadic second-order transductions. More precisely, we study the preorder where we set C \subseteq K if, and only if, there exists a transduction {\tau} such that C\subseteq{\tau}(K).
Achim Blumensath, Bruno Courcelle
doaj +1 more source
European Journal of Ophthalmology, 2021 Purpose: To compare and evaluate corneal higher-order aberrations (c-HOA) between conventional manual phacoemulsification (Phaco), femtosecond laser-assisted cataract surgery (FLACS), and femtosecond laser-assisted cataract surgery with astigmatic ...
D. Pohlmann +3 more
semanticscholar +1 more source