# Space II

## Papers overview

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

2011

2011

- 2011

Fix an infinite field $k$ of characteristic $p$, and let $\g$ be the Kac-Moody algebra $\mathfrak{sl}_{\infty}$ if $p=0$ and… (More)

Is this relevant?

2007

2007

- 2007

The paper presents the further development of theoretical model of the Single Information Space for the Environment in Europe… (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- 2005

The improvement of an innovative dual membrane contactor process for treatment of combined hygiene and metabolic wastewater was… (More)

Is this relevant?

1999

1999

- 1999

It is shown that all of the equations integrable by means of the Ablowitz-Kaup-Newell-Segur (AKNS) scheme have natural counter… (More)

Is this relevant?

Highly Cited

1998

Highly Cited

1998

- 1998

We use the AdS-CFT correspondence to calculate CFT correlation functions of vector and spinor fields. The connection between the… (More)

Is this relevant?

Highly Cited

1995

Highly Cited

1995

- 1995

Abstract:This is the second of two papers on the zero-viscosity limit for the incompressible Navier-Stokes equations in a half… (More)

Is this relevant?

1994

1994

- Geometry-Driven Diffusion in Computer Vision
- 1994

In the previous chapter a formal justification has been given for using linear filtering as an initial step in early processing… (More)

Is this relevant?

1989

1989

Linking (n − 2)-dimensional panels inn-space II: (n − 2, 2)-frameworks and body and hinge structures

- Graphs and Combinatorics
- 1989

An (n − 1, 2)-framework inn-space is a structure consisting of a finite set of (n − 2)-dimensional panels and a set of rigid bars… (More)

Is this relevant?

1988

1988

- Eur. J. Comb.
- 1988

A complete classification is given of pencils of quadrics in projective space of three dimensions over a finite field, where each… (More)

Is this relevant?

1979

1979

- 20th Annual Symposium on Foundations of Computer…
- 1979

Logarithmically t(n)-time bounded RAMs can be simulated by t(n)/log t(n)-tape bounded Turing machines, t(n)-time bounded… (More)

Is this relevant?