Reducibility by means of almost polynomial functions
From MaRDI portal
Publication:6132642
DOI10.3103/S1066369X2212009XOpenAlexW4327777670MaRDI QIDQ6132642FDOQ6132642
Authors: S. S. Marchenkov 
Publication date: 14 July 2023
Published in: Russian Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3103/s1066369x2212009x
Recommendations
Cites Work
- Reducibility among combinatorial problems
- Title not available (Why is that?)
- The complexity of theorem-proving procedures
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the structure of partially ordered sets of Boolean degrees
- Boolean reducibility
- Complete degrees of finite-state transformability
- On maximal and minimal elements of partially ordered sets of Boolean degrees
- Title not available (Why is that?)
- Complete and incomplete Boolean degrees
- Strong reducibilities
- Title not available (Why is that?)
- Statistical estimation of the structure of a finite population
- Closed left-r.e. sets
- Title not available (Why is that?)
Cited In (10)
- Associative idempotent nondecreasing functions are reducible
- Poly-element equations reducible to moment problem for entire functions of class A
- Title not available (Why is that?)
- The total reducibility order of a polynomial in two variables
- A note on polynomial reduction
- A poly-algorithmic approach to simplifying elementary functions
- On the reduced length of a polynomial with real coefficients
- Reducibility of polynomials of the form f(x)-g(y)
- \(m\)-reducibility with upper and lower bounds for reducing functions
- A solution for reducing the degree of polynomial composition functions using Faà di Bruno's formula and Fourier transform
This page was built for publication: Reducibility by means of almost polynomial functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132642)
