Results 91 to 100 of about 296,040 (177)
Equality Algebra pada Heyting Algebra, Hertz Algebra, Boolean Algebra, dan EQ-Algebra [PDF]
, 2018 Bentuk struktur aljabar yang akan dibahas di sini adalah Equality Algebra, Heyting Algebra, Hertz Algebra, Boolean Algebra, dan EQ-Algebra. Dari bentuk struktur aljabar yang telah ditunjukkan, Equality Algebra yang dibahas di sini dikembangkan dari EQ ...
Wicaksana, Aulia Imam
core
Logical Methods in Computer ScienceThe author has recently introduced an abstract algebraic framework of analogical proportions within the general setting of universal algebra. This paper studies analogical proportions in the boolean domain consisting of two elements 0 and 1 within his ...
Christian Antić
doaj +1 more source
Complexity of Boolean algebras
Theoretical Computer Science, 1980 AbstractWe show that the elementary theory of Boolean algebras is ⩽log-complete for the Berman complexity class ...
openaire +1 more source
Sparse Minimum Redundancy Maximum Relevance for Feature Selection
Scandinavian Journal of Statistics, Volume 53, Issue 3, Page 1134-1151, September 2026.ABSTRACT We propose a feature screening method that integrates both feature–feature and feature–target relationships. Inactive features are identified via a penalized minimum Redundancy Maximum Relevance (mRMR) procedure, which is the continuous version of the classical mRMR penalized by a non‐convex regularizer, and where the parameters estimated as ...
Peter Naylor +3 more
wiley +1 more source
ROUGH LATTICE OVER BOOLEAN ALGEBRA
Journal of New Theory, 2015 − Rough Set Theory (RST) is a mathematical formalism for representing uncertainty thatcan be considered as an extension of the classical set theory. It has been used in many differentresearch areas, including those related to inductive machine learning ...
Dipankar Rana, Sankar Kumar Roy
doaj
International Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.ABSTRACT This study proposes a quantum computing algorithm for dynamic structural analysis, assuming the use of quantum computers. Specifically, we apply a quantum algorithm known as Hamiltonian Simulation (HS), which calculates the time evolution of the Schrödinger equation with time‐independent coefficients, to the equations of motion governing the ...
Koya Wagatsuma +2 more
wiley +1 more source
Is Quantum Field Theory Necessarily “Quantum”?
Quantum ReportsThe mathematical universe of the quantum topos, which is formulated on the basis of classical Boolean snapshots, delivers a neo-realist description of quantum mechanics that preserves realism.
Ali Shojaei-Fard
doaj +1 more source
Partitioned Balancing Domain Decomposition Method for Heterogeneous Static Structures
International Journal for Numerical Methods in Engineering, Volume 127, Issue 16, 30 August 2026.ABSTRACT This study proposes a partitioned balancing domain decomposition (P‐BDD) method for static analysis of heterogeneous structures. The P‐BDD method may be viewed as a localized version of traditional BDD approaches. Its principal solution vector consists of unassembled partition‐boundary displacements, used to compute the partition‐interior ...
Seung‐Hoon Kang +3 more
wiley +1 more source
, 2012 This Saylor course is an extension of abstract algebra I and revisits structures like groups, rings and fields as well as mappings like homomorphisms and isomorphisms.
algebra, The Saylor Foundation
core
Boolean differential operators [PDF]
, 2014 summary:We consider four combinatorial interpretations for the algebra of Boolean differential operators and construct, for each interpretation, a matrix representation for the algebra of Boolean differential ...
Catumba, Jorge, Díaz, Rafael
core +1 more source