Journal of the American Mathematical Society

Paper

01 Jan 1993

Complexity of bezout’s theorem. I: Geometric aspects

Abstract

No abstract available.

Related

Conference paper

Distilling common randomness from bipartite quantum states

Igor Devetak, Andreas Winter

ISIT 2003

Paper

Irredundancy in circular arc graphs

Martin Charles Golumbic, Renu C. Laskar

Discrete Applied Mathematics

Paper

A generic grouping algorithm and its quantitative analysis

Arnon Amir, Michael Lindenbaum

IEEE Transactions on Pattern Analysis and Machine Intelligence

Conference paper

Bounds on the ergodic capacity of training-based multiple-antenna systems

Simeon Furrer, Dirk Dahlhaus

ISIT 2005

View all publications