"Automating algebraic proof systems is NP-hard."

Susanna F. de Rezende et al. (2021)

> Home

Details and statistics

DOI: 10.1145/3406325.3451080

access: closed

type: Conference or Workshop Paper

metadata version: 2025-01-19

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/stoc/RezendeGNPR021
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/stoc/RezendeGNPR021
Susanna F. de Rezende, Mika Göös, Jakob Nordström, Toniann Pitassi, Robert Robere, Dmitry Sokolov:
Automating algebraic proof systems is NP-hard. STOC 2021: 209-222

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.