"Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial ..."

Wied Pakusa, Svenja Schalthöfer, Erkal Selman (2018)

> Home

Details and statistics

DOI: 10.1145/3154456

access: closed

type: Journal Article

metadata version: 2023-09-30

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/PakusaSS18
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/PakusaSS18
Wied Pakusa, Svenja Schalthöfer, Erkal Selman:
Definability of Cai-Fürer-Immerman Problems in Choiceless Polynomial Time. ACM Trans. Comput. Log. 19(2): 7:1-7:27 (2018)

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.