A combinatorial proof of the effective Nullstellensatz (Q2368067): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
| (4 intermediate revisions by 3 users not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Christodor-Paul Ionescu / rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Christodor-Paul Ionescu / 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/jsco.1993.1020 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2049116960 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 22:22, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A combinatorial proof of the effective Nullstellensatz |
scientific article |
Statements
A combinatorial proof of the effective Nullstellensatz (English)
0 references
22 August 1993
0 references
The degree bound in the effective Nullstellensatz is obtained using combinatorial methods, namely counting arguments for the ideal \(I\).
0 references
effective Nullstellensatz
0 references
