"On modeling NP-Complete problems as polynomial-sized linear programs: ..."

Moustapha Diaby, Mark H. Karwan, Lei Sun (2023)

> Home

SPARQL queries

Details and statistics

DOI: 10.48550/ARXIV.2304.07716

access: open

type: Informal or Other Publication

metadata version: 2023-04-21

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/corr/abs-2304-07716
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/abs-2304-07716
Moustapha Diaby, Mark H. Karwan, Lei Sun:
On modeling NP-Complete problems as polynomial-sized linear programs: Escaping/Side-stepping the "barriers". CoRR abs/2304.07716 (2023)

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.