On the complexity of simplifying quadratic forms

Research output: Contribution to journalArticle

Original languageEnglish (US)
Pages (from-to)217-220
Number of pages4
JournalInformation Processing Letters
Volume12
Issue number5
DOIs
StatePublished - Oct 13 1981
Externally publishedYes

Fingerprint

Algebraic Complexity
NP-completeness
Quadratic form

Keywords

  • Algebraic complexity
  • NP completeness
  • quadratic forms

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Signal Processing
  • Information Systems
  • Computer Science Applications

Cite this

On the complexity of simplifying quadratic forms. / Snir, M.

In: Information Processing Letters, Vol. 12, No. 5, 13.10.1981, p. 217-220.

Research output: Contribution to journalArticle

@article{137e8965854140d4a34f5c700333f355,
title = "On the complexity of simplifying quadratic forms",
keywords = "Algebraic complexity, NP completeness, quadratic forms",
author = "M. Snir",
year = "1981",
month = "10",
day = "13",
doi = "10.1016/0020-0190(81)90017-X",
language = "English (US)",
volume = "12",
pages = "217--220",
journal = "Information Processing Letters",
issn = "0020-0190",
publisher = "Elsevier",
number = "5",

}

TY - JOUR

T1 - On the complexity of simplifying quadratic forms

AU - Snir, M.

PY - 1981/10/13

Y1 - 1981/10/13

KW - Algebraic complexity

KW - NP completeness

KW - quadratic forms

UR - http://www.scopus.com/inward/record.url?scp=49049150627&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=49049150627&partnerID=8YFLogxK

U2 - 10.1016/0020-0190(81)90017-X

DO - 10.1016/0020-0190(81)90017-X

M3 - Article

AN - SCOPUS:49049150627

VL - 12

SP - 217

EP - 220

JO - Information Processing Letters

JF - Information Processing Letters

SN - 0020-0190

IS - 5

ER -