Feasible Algorithms for Lattice and Directed Subspaces

Mathematical Proceedings of the Royal Irish Academy
doi 10.3318/pria.2014.114.11
Full Text
Abstract

Available in full text

Date
Authors

Unknown

Publisher

Royal Irish Academy

Related search

Nearly Directed Subspaces of Partially Ordered Linear Spaces

Proceedings of the Edinburgh Mathematical Society
Mathematics
1968English

On Approximating the Covering Radius and Finding Dense Lattice Subspaces

2019English

7BThe 2-Dimensional Lattice-Subspaces in Finite-State Finance

Journal of Mathematical Finance
2014English

On the Lattice of Closed Subspaces of Hilbert Space

Pacific Journal of Mathematics
Mathematics
1966English

Genetic Algorithms With Feasible Operators for Solving Job Shop Scheduling Problem

Journal of scientific research
2020English

HKZ and Minkowski Reduction Algorithms for Lattice-Reduction-Aided MIMO Detection

IEEE Transactions on Signal Processing
Electronic EngineeringSignal ProcessingElectrical
2012English

Directed Bond Percolation on the Honeycomb Lattice

Journal of Physics A: Mathematical and General
1990English

Approximating Cycles in Directed Graphs: Fast Algorithms for Girth and Roundtrip Spanners

2018English

Will a mAb-Based Immunotherapy Directed Against Cancer Stem Cells Be Feasible?

Frontiers in Immunology
AllergyImmunology
2017English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy