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.

2021

2021

A central problem in discrete geometry, known as Hadwiger's covering problem, asks what the smallest natural number $N\left(n… Expand

2016

2016

Zero point problems of two accretive operators and fixed point problems of a nonexpansive mappings are investigated based on a… Expand

Highly Cited

2013

Highly Cited

2013

We show that unless P = NP, there exists no polynomial time (or even pseudo-polynomial time) algorithm that can decide whether a… Expand

Highly Cited

2010

Highly Cited

2010

We prove the Fundamental Gap Conjecture, which states that the difference between the first two Dirichlet eigenvalues (the spec… Expand

2006

2006

We consider convex sets whose modulus of convexity is uniformly quadratic. First, we observe several interesting relations… Expand

Highly Cited

2005

Highly Cited

2005

The design of linear transceivers for multiple-input-multiple-output (MIMO) communication systems with channel state information… Expand

Highly Cited

2003

Highly Cited

2003

It is shown that every symmetric convex body which satisfies a kind of weak law of large numbers has the property that almost all… Expand

Highly Cited

2001

Highly Cited

2001

Some relations between the James (or non-square) constant $J(X)$ and the Jordan-von Neumann constant $C_NJ(X),$ and the normal… Expand

1974

1974

This note shows that convexity cuts defined relative to polyhedral convex sets can utilize negative as well as positive edge… Expand

Highly Cited

1974

Highly Cited

1974

There is a uniformly convex Banach space with unconditional basis which contains no subspace isomorphic to any lp (1 p ~). The… Expand