"Complexity of Semialgebraic Proofs with Restricted Degree of Falsity."

Edward A. Hirsch et al. (2009)

> Home

Details and statistics

DOI: 10.3233/SAT190062

access: open

type: Journal Article

metadata version: 2020-08-17

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/jsat/HirschKKN09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsat/HirschKKN09
Edward A. Hirsch, Arist Kojevnikov, Alexander S. Kulikov, Sergey I. Nikolenko:
Complexity of Semialgebraic Proofs with Restricted Degree of Falsity. J. Satisf. Boolean Model. Comput. 6(1-3): 53-69 (2009)

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.