"A Polynomial Time Algorithm for Read-Once Certification of Linear ..."

K. Subramani, Piotr Wojciechowski (2019)

> Home

Details and statistics

DOI: 10.1007/S00453-019-00554-Z

access: closed

type: Journal Article

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/SubramaniW19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/SubramaniW19
K. Subramani, Piotr Wojciechowski:
A Polynomial Time Algorithm for Read-Once Certification of Linear Infeasibility in UTVPI Constraints. Algorithmica 81(7): 2765-2794 (2019)

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.