Density Bounds for the 3x + 1 Problem. I. Tree-Search Method

Mathematics of Computation - United States
doi 10.2307/2153345
Full Text
Abstract

Available in full text

Date
Authors
Publisher

JSTOR

Related search

Uniform Distribution in the (3x+1)-Problem

Moscow Mathematical Journal
Mathematics
2003English

Heuristic Search for the Generalized Minimum Spanning Tree Problem

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

Bounds for the Quadratic Assignment Problem Using the Bundle Method

Mathematical Programming, Series B
MathematicsSoftware
2006English

Tabu Search and Lower Bounds for a Combined Production–transportation Problem

Computers and Operations Research
Management ScienceSimulationComputer ScienceOperations ResearchModeling
2013English

Local Search for the Minimum Label Spanning Tree Problem With Bounded Color Classes

Operations Research Letters
IndustrialApplied MathematicsManufacturing EngineeringManagement ScienceOperations ResearchSoftware
2003English

On the Covering Radius Problem for Codes I. Bounds on Normalized Covering Radius

SIAM Journal on Algebraic Discrete Methods
1987English

Density Bounds for Euler’s Function

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1972English

Synthesis, Structure, and Thermal Stability of New Scheelite-Type Pb1−3x□xPr2x(MoO4)1−3x(WO4)3x Ceramic Materials

Journal of Thermal Analysis and Calorimetry
Theoretical ChemistryCondensed Matter PhysicsPhysical
2016English

Lower Bounds for Oblivious Near-Neighbor Search

2020English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy