The Complexity of Integer Bound Propagation

Journal of Artificial Intelligence Research - United States
doi 10.1613/jair.3248
Full Text
Abstract

Available in full text

Date
Authors
Publisher

AI Access Foundation

Related search

Optimal Bound on the Combinatorial Complexity of Approximating Polytopes

2020English

Design Considerations of a Low-Complexity, Low-Power Integer Turbo Decoder

IFIP Advances in Information and Communication Technology
Computer NetworksInformation SystemsManagementCommunications
2002English

Lower-Bound Time-Complexity Analysis of Logic Programs

1997English

An Effective Branch-And-Bound Algorithm for Convex Quadratic Integer Programming

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Limitations of Lower-Bound Methods for the Wire Complexity of Boolean Operators

2012English

A Lower Bound for the Complexity of the Union-Split-Find Problem

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

Folding Minimal Sequences: The Lower Bound for Sequence Complexity of Globular Proteins

FEBS Letters
GeneticsCell BiologyMolecular BiologyBiochemistryStructural BiologyBiophysics
1999English

A Time Complexity Lower Bound for Adaptive Mutual Exclusion

Distributed Computing
Computer NetworksHardwareCommunicationsArchitectureComputational TheoryMathematicsTheoretical Computer Science
2011English

A Two-Stage Parallel Branch and Bound Algorithm for Mixed Integer Programs

IMA Journal of Management Mathematics
ManagementFinanceApplied MathematicsEconomicsSimulationManagement ScienceManagement Information SystemsModelingStrategyEconometricsOperations Research
2004English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy