"Worst-case time bounds for coloring and satisfiability problems."

Tomás Feder, Rajeev Motwani (2002)

> Home

Details and statistics

DOI: 10.1016/S0196-6774(02)00224-9

access: closed

type: Journal Article

metadata version: 2020-01-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jal/FederM02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jal/FederM02
Tomás Feder, Rajeev Motwani:
Worst-case time bounds for coloring and satisfiability problems. J. Algorithms 45(2): 192-201 (2002)

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.