Time-space tradeoffs in algebraic complexity theory (Q1977138): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1006/jcom.1999.0526 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1006/jcom.1999.0526 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978035078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for algebraic problems on general sequential machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simplified lower bounds for polynomials with algebraic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general Sequential Time-Space Tradeoff for Finding Unique Elements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3770650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Tradeoff for Element Distinctness / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space tradeoff for sorting on non-oblivious machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4331740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4204240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4203817 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556574 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-space tradeoff for language recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nullstellensatz effectif et Conjecture de Serre (Théorème de Quillen-Suslin) pour le Calcul Formel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328651 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some polynomials that are hard to compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for diophantine approximations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-line programs in geometric elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Application of separability and independence notions for proving lower bounds of circuit complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability and fast quantifier elimination in algebraically closed fields / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3835021 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the intrinsic complexity of elimination theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3942397 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for polynomials with algebraic coefficients / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space trade-offs for some algebraic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sharp Effective Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: On intrinsic bounds in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4714022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How can a complex square root be computed in an optimal way? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4729767 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for arithmetic networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4352783 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space trade-offs in a pebble game / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Time-Space Trade-Off / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical foundations of computer science 1980. Proceedings of the 9th Symposium held in Rydzyna, Poland, September 1-5, 1980 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-Time Trade-Offs for Banded Matrix Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs on the FFT algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4190139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3920647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved lower bounds on the number of multiplications/divisions which are necessary to evaluate polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4302493 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounds for the Hilbert function of polynomial ideals and for the degrees in the Nullstellensatz / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for the complexity of polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the representation of rational functions of bounded complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with Rational Coefficients Which are Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385517 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for computing functions, using connectivity properties of their circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3336589 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3259734 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-space tradeoffs for matrix multiplication and the discrete Fourier transform on any general sequential random-access computer / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1006/JCOM.1999.0526 / rank
 
Normal rank

Latest revision as of 16:04, 16 December 2024

scientific article
Language Label Description Also known as
English
Time-space tradeoffs in algebraic complexity theory
scientific article

    Statements

    Time-space tradeoffs in algebraic complexity theory (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2000
    0 references
    polynomial evaluation procedures
    0 references
    straight-line programs
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers