Binary segmentation for multivariate polynomials

DOI10.1006/JCOM.1995.1015zbMATH Open0851.68042OpenAlexW1969068170MaRDI QIDQ1908892FDOQ1908892

Jürgen Klose

Publication date: 10 November 1996

Published in: Journal of Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jcom.1995.1015

zbMATH Keywords

binary segmentationmultivariate integer polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Cited In (1)

• On the complexity of Chow and Hurwitz forms

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Orthogonal continuous segmentation polynomial 👍 👎
• A fast segmentation algorithm for piecewise polynomial numeric function generators 👍 👎
• Polynomial partitioning for several sets of varieties 👍 👎
• Polynomial partitioning for a set of varieties 👍 👎
• Fast Polynomial Segmentation of Digitized Curves 👍 👎
• On polynomials of binary variables 👍 👎
• Strongly polynomial efficient approximation scheme for segmentation 👍 👎
• Binary segmentation for matrix and vector operations 👍 👎

This page was built for publication: Binary segmentation for multivariate polynomials

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