This project allows users to dynamically create and plot polynomial functions of varying degrees with user-defined coefficients and intercepts. The graph shows the polynomial curve along with the ...

The original code is as old as from 1995 and was written by Gerhard Krucker (see http://www.krucker.ch/skripten-uebungen/IAMSkript/IAMKap3.pdf#page=14). So all ...

Algorithmic complexity, a cornerstone of theoretical computer science, examines the intrinsic resource requirements of computational problems and the limits of what can be efficiently computed. Within ...

In this paper, an algebraic method which is based on the groebner bases theory is proposed to solve the polynomial functions conditional extreme. Firstly, we describe how to solve conditional extreme ...

Abstract: Bent functions are maximally nonlinear Boolean functions with an even number of variables. They were introduced by Rothaus in 1976. For their own sake as interesting combinatorial objects, ...

Mathematics of Computation, Vol. 34, No. 150 (Apr., 1980), pp. 441-463 (23 pages) Constructive proofs and several generalizations of approximation results of J. H. Bramble and S. R. Hilbert are ...

Abstract: This paper investigates the stability of polynomial-fuzzy-model-based (PFMB) control system, which is formed by a polynomial fuzzy model and a polynomial fuzzy controller connected in a ...