Subspace Restrictions and Affine Composition for Covering Perfect Hash Families

The Art of Discrete and Applied Mathematics
doi 10.26493/2590-9770.1220.3a1
Full Text
Abstract

Available in full text

Date
Authors
Publisher

University of Primorska Press

Related search

A Simulated Annealing Algorithm to Construct Covering Perfect Hash Families

Mathematical Problems in Engineering
MathematicsEngineering
2018English

The Maximal Subspace for Generation Of(a,k)-Regularized Families

Abstract and Applied Analysis
Applied MathematicsAnalysis
2012English

Random Rule Sets – Combining Random Covering With the Random Subspace Method

International Journal of Machine Learning and Computing
ManagementComputer Science ApplicationsInformation SystemsArtificial Intelligence
2018English

Families of $\Mathbb{A}^1$-Contractible Affine Threefolds

Algebraic Geometry
GeometryTopologyNumber TheoryAlgebra
2018English

Covering Orthogonal Polygons With Star Polygons: The Perfect Graph Approach

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1990English

Application of Covering Techniques to Families of Curves

Journal of Number Theory
Number TheoryAlgebra
2003English

Searching for a Perfect Composition for a Board of Directors

Journal of Corporate Responsibility and Leadership
2017English

Metric and Bregman Projections Onto Affine Subspaces and Their Computation via Sequential Subspace Optimization Methods

Journal of Inverse and Ill-Posed Problems
Applied Mathematics
2008English

Optimal Families of Perfect Polyphase Sequences From Cubic Polynomials

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Electronic EngineeringComputer GraphicsSignal ProcessingApplied MathematicsElectricalComputer-Aided Design
2018English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy