Amanote Research

Amanote Research

    RegisterSign In

Using Representation Theorems for Proving Polynomials Non-Negative

Lecture Notes in Computer Science - Germany
doi 10.1007/978-3-319-13770-4_4
Full Text
Open PDF
Abstract

Available in full text

Categories
Computer ScienceTheoretical Computer Science
Date

January 1, 2014

Authors
Salvador Lucas
Publisher

Springer International Publishing


Related search

Collaborative Representation Using Non-Negative Samples for Image Classification

Sensors
InstrumentationInformation SystemsElectronic EngineeringBiochemistryAnalytical ChemistryMolecular Physics,ElectricalAtomicMedicineOptics
2019English

Proving Theorems by Program Transformation

Fundamenta Informaticae
Information SystemsAlgebraNumber TheoryMathematicsComputational TheoryTheoretical Computer Science
2013English

Some Renewal Theorems for Non-Negative Independent Random Variables

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1965English

Proving Non-Termination Using Max-SMT

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

A Non-Negative Representation Learning Algorithm for Selecting Neighbors

Machine Learning
Artificial IntelligenceSoftware
2015English

Representation Theorems for Closure Spaces

Colloquium Mathematicum
Mathematics
1968English

Tableau-Based Theorem Proving for Representation and Reasoning.

English

Non-Negative Hereditary Polynomials in a Free *−algebra

Mathematische Zeitschrift
Mathematics
2005English

Symmetric Polynomials for 2D Shape Representation

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy