Publication

Discrete Optimal Transport with Independent Marginals is #P-Hard

Related publications (65)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

1999

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

This work is concerned with the computational complexity of the recognition of

\mbox{LP}_2

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Several subclasses of

\mbox{LP}_2

of particular interest ...

IDIAP1996

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

This work is concerned with the computational complexity of the recognition of

ÞPtwo

, the class of regions of the Euclidian space that can be classified exactly by a two-layered perceptron. Some subclasses of

ÞPtwo

of particular interest are also studi ...

IDIAP1998

Discrete Optimal Transport with Independent Marginals is #P-Hard

Graph Chatbot

Chat with Graph Search

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

A polynomial case of inconstrained zero-one queadratic optimization

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons

On the Complexity of the Class of Regions Computable by a Two-Layered Perceptron

Preemptive open shop scheduling with multiprocessors: polynomial cases and applications

A polynomial case of inconstrained zero-one queadratic optimization

On the Complexity of Recognizing Regions Computable by Two-Layered Perceptrons