An Efficient Implementation of a Quasi-Polynomial Algorithm for Generating Hypergraph Transversals

Lecture Notes in Computer Science- Germany

doi 10.1007/978-3-540-39658-1_51

Full Text

Abstract

Available in

Date

Authors

Publisher

Springer Berlin Heidelberg

Related search

An Efficient Polynomial Space and Polynomial Delay Algorithm for Enumeration of Maximal Motifs in a Sequence

Journal of Combinatorial Optimization
ControlOptimizationCombinatoricsApplied MathematicsDiscrete MathematicsComputer Science ApplicationsMathematicsComputational Theory
2006English

A Pseudo-Quasi-Polynomial Algorithm for Mean-Payoff Parity Games

2018English

An Efficient Algorithm for Generating Assembly Sequences in Modification Design.

Seimitsu Kogaku Kaishi/Journal of the Japan Society for Precision Engineering
Mechanical Engineering
1994English

An Efficient FPGA Implementation of AES Algorithm

International Journal of Engineering Research and
2016English

A New Polynomial Factorization Algorithm and Its Implementation

Journal of Symbolic Computation
Computational MathematicsNumber TheoryAlgebra
1995English

An Efficient Implementation of Non Symmetric Lanczos Algorithm,

1995English

An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

The Relationship Between Quasi-Medial Idempotents and Quasi-Adequate Transversals

International Journal of Pure and Applied Mathematics
MathematicsApplied Mathematics
2013English

Scheduling of a LQ Control Algorithm for Efficient FPGA Implementation

IFAC Proceedings Volumes
2008English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy