default search action

combined dblp search
author search
venue search
publication search

ask others

"Checking Monotonicity is NP-Hard Even for Cubic Polynomials."

Andrzej Pownuk, Luc Longpré, Vladik Kreinovich (2013)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2020-04-16

- view
  - electronic edition @ louisiana.edu (open access)
- export record
  dblp key:
  - journals/rc/PownukLK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rc/PownukLK13
Andrzej Pownuk, Luc Longpré, Vladik Kreinovich:
Checking Monotonicity is NP-Hard Even for Cubic Polynomials. Reliab. Comput. 18: 90-96 (2013)

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.