Tight Bounds on the Complexity of the Apostolico-Giancarlo Algorithm

Information Processing Letters - Netherlands
doi 10.1016/s0020-0190(97)00107-5
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2013English

Tight Bounds on the Coefficients of Partition Functions via Stability

Journal of Combinatorial Theory - Series A
CombinatoricsComputational TheoryDiscrete MathematicsTheoretical Computer ScienceMathematics
2018English

Bounds on the Complexity of the Longest Common Subsequence Problem

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1976English

On the Communication Complexity Methodology for Proving Lower Bounds on the Query Complexity of Property Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2020English

On the Complexity of the BKW Algorithm on LWE

Designs, Codes, and Cryptography
CombinatoricsApplied MathematicsComputer Science ApplicationsTheoretical Computer ScienceDiscrete Mathematics
2013English

Tight Upper and Lower Bounds on the Path Length of Binary Trees

SIAM Journal on Computing
MathematicsComputer Science
1994English

Upper Bounds on the Complexity of Some Galois Theory Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Bounds on the Kolmogorov Complexity Function for Infinite Words

2016English

Tight Failure Detection Bounds on Atomic Object Implementations

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
2010English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy