Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The Matching Problem Has No Fully Polynomial Size Linear Programming ..."

Gábor Braun, Sebastian Pokutta (2015)

> Home

Details and statistics

DOI: 10.1109/TIT.2015.2465864

access: closed

type: Journal Article

metadata version: 2020-03-10

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tit/BraunP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tit/BraunP15
Gábor Braun, Sebastian Pokutta:
The Matching Problem Has No Fully Polynomial Size Linear Programming Relaxation Schemes. IEEE Trans. Inf. Theory 61(10): 5754-5764 (2015)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.