CT-EXT: An Algorithm for Computing Typical Testor Set

doi 10.1007/978-3-540-76725-1_53
Full Text
Abstract

Available in full text

Date

Unknown

Authors
Publisher

Springer Berlin Heidelberg

Related search

An Almost Optimal Algorithm for Computing Nonnegative Rank

2013English

An Algorithm for Computing the Distance to Uncontrollability

Systems and Control Letters
ControlSystems EngineeringMechanical EngineeringElectronic EngineeringElectricalComputer Science
1991English

An FPT Algorithm for Edge Subset Feedback Edge Set

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2012English

An Algorithm for Computing Minimal Bidirectional Linear Recurrence Relations

IEEE Transactions on Information Theory
Computer Science ApplicationsInformation SystemsLibraryInformation Sciences
2009English

An Optimal Algorithm for Computing Visibility in the Plane

SIAM Journal on Computing
MathematicsComputer Science
1995English

An Optimal Maximal Independent Set Algorithm for Bounded-Independence Graphs

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2010English

An Optimal Algorithm for Computing All Subtree Repeats in Trees

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

An Algorithm for Documenting Relationships in a Set of Reports

Journal of Software
2008English

Newton Polyhedra and an Algorithm for Computing Hodge–deligne Numbers

Mathematics of the USSR-Izvestiya
1987English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy