The Streaming Complexity of Cycle Counting, Sorting by Reversals, and Other Problems

doi 10.1137/1.9781611973082.2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Sorting Permutations by Reversals Through Branch-And-Price

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2001English

Average-Case Analysis of Perfect Sorting by Reversals

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Exploring the Solution Space of Sorting by Reversals, With Experiments and an Application to Evolution

IEEE/ACM Transactions on Computational Biology and Bioinformatics
BiotechnologyApplied MathematicsGenetics
2008English

The Alphabet Effect Re-Visited, McLuhan Reversals and Complexity Theory

Philosophies
2017English

An Algorithm to Enumerate Sorting Reversals for Signed Permutations

Journal of Computational Biology
GeneticsMolecular BiologyComputational TheorySimulationComputational MathematicsMathematicsModeling
2003English

Lower Bounds for the Parameterized Complexity of Minimum Fill-In and Other Completion Problems

2015English

How to Count Quickly and Accurately: A Unified Analysis of Probabilistic Counting and Other Related Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1992English

The Network-Complexity of Equivalence and Other Applications of the Network Complexity

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1975English

Counting Ethnicity in Malaysia: The Complexity of Measuring Diversity

Social Statistics and Ethnic Diversity
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy