A logarithmic Boolean time algorithm for parallel polynomial division
Copyright policy )A logarithmic Boolean time algorithm for parallel polynomial division
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- University of Pisa Italy
- University at Albany, State University of New York United States
- State University of New York at Potsdam United States
triangular Toeplitz matrix inversion, Analysis of algorithms and problem complexity, interpolation by binary segmentation, parallel computational complexity, Direct numerical methods for linear systems and matrix inversion, Boolean circuit complexity, Software, source code, etc. for problems pertaining to field theory, division with remainder, integer polynomials, polynomial division
triangular Toeplitz matrix inversion, Analysis of algorithms and problem complexity, interpolation by binary segmentation, parallel computational complexity, Direct numerical methods for linear systems and matrix inversion, Boolean circuit complexity, Software, source code, etc. for problems pertaining to field theory, division with remainder, integer polynomials, polynomial division
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).2 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Average
Citations provided by BIP!Popularity provided by BIP!