Skip to search formSkip to main content>Semantic Scholar Semantic Scholar's Logo

Search

You are currently offline. Some features of the site may not work correctly.

Semantic Scholar uses AI to extract papers important to this topic.

Review

2018

Review

2018

Transition modelling is an emerging but growing niche within the broader field of sustainability transitions research. The… Expand

Is this relevant?

2008

2008

Systems of polynomial equations over an algebraically-closed field K can be used to concisely model many combinatorial problems… Expand

Is this relevant?

Highly Cited

2000

Highly Cited

2000

In the first part of this thesis, we introduce a specific class of Linear Matrix Inequalities (LMI) whose optimal solution can be… Expand

Is this relevant?

Highly Cited

1997

Highly Cited

1997

NP = PCP(logn, 1) and related results crucially depend upon the close connection between the probability with which a function… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

We show that if the Generalized Riemann Hypothesis is true, the problem of deciding whether a system of polynomial equations in… Expand

Is this relevant?

Highly Cited

1996

Highly Cited

1996

A propositional proof system can be viewed as a non-deterministic algorithm for the (co-NP complete) unsatisfiabilit y problem… Expand

Is this relevant?

Highly Cited

1995

Highly Cited

1995

Commutative Algebra is best understood with knowledge of the geometric ideas that have played a great role in its formation, in… Expand

Is this relevant?

Highly Cited

1994

Highly Cited

1994

The weak form of the Hilbert's Nullstellensatz says that a system of algebraic equations over a field, Q/sub i/(x~)=0, does not… Expand

Is this relevant?

Highly Cited

1988

Highly Cited

1988

The usual proofs of this result, however, give no information about the g1's; for instance they give no bound on their degrees… Expand

Is this relevant?

Highly Cited

1986

Highly Cited

1986

The theory of elementary algebra and elementary geometry was shown to be decidable by Tarski using a quantifier elimination… Expand

Is this relevant?