A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds

DOI10.1007/S11227-005-0032-6zbMATH Open1071.68518OpenAlexW2042457395MaRDI QIDQ1777451FDOQ1777451

Authors: W.-L. Chang, Chih-Ping Chu, J.-H. Wu 

Publication date: 17 May 2005

Published in: The Journal of Supercomputing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11227-005-0032-6

Recommendations

• A polynomial-time test for M-matrices
• A polynomial-time test for total dual integrality in fixed dimension
• A simple test for integer programming problems with bounded integer variables
• The complexity of testing monomials in multivariate polynomials
• Deterministically testing sparse polynomial identities of unbounded degree
• Deterministic polynomial identity tests for multilinear bounded-read formulae
• scientific article; zbMATH DE number 2079409
• Algorithms for testing monomials in multivariate polynomials
• Polynomial-time algorithms for probabilistic solutions of parameter-dependent linear matrix inequalities
• Binomiality testing and computing sparse polynomials via witness sets

zbMATH Keywords

generalized Lambda test

Mathematics Subject Classification ID

Theory of compilers and interpreters (68N20)

Cited In (2)

• A multi-dimensional version of the I test
• The generalized Direction Vector I test

This page was built for publication: A polynomial-time dependence test for determining integer-valued solutions in multi-dimensional arrays under variable bounds

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1777451)