Conversion From Arithmetic to Boolean Masking With Logarithmic Complexity

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-662-48116-5_7
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Lightweight Conversion From Arithmetic to Boolean Masking for Embedded IoT Processor

Applied Sciences (Switzerland)
InstrumentationMaterials ScienceFluid FlowEngineeringComputer Science ApplicationsProcess ChemistryTransfer ProcessesTechnology
2019English

A New Algorithm for Switching From Arithmetic to Boolean Masking

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Classes of Boolean Functions With Limited Complexity

Prikladnaya diskretnaya matematika. Prilozhenie
2019English

Logarithmic Arithmetic as an Alternative to Floating-Point: A Review

2013English

The Complexity of Reasoning With Boolean Modal Logics

2002English

Complexity of Presburger Arithmetic With Fixed Quantifier Dimension

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
1997English

The Structure of Logarithmic Advice Complexity Classes

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
1998English

Complexity of Subcases of Presburger Arithmetic

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1984English

The Monotone Circuit Complexity of Boolean Functions

Combinatorica
CombinatoricsComputational MathematicsDiscrete Mathematics
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy