"Flat and one-variable clauses: Complexity of verifying cryptographic ..."

Helmut Seidl, Kumar Neeraj Verma (2008)

> Home

Details and statistics

DOI: 10.1145/1380572.1380577

access: closed

type: Journal Article

metadata version: 2018-11-06

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tocl/SeidlV08
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tocl/SeidlV08
Helmut Seidl, Kumar Neeraj Verma:
Flat and one-variable clauses: Complexity of verifying cryptographic protocols with single blind copying. ACM Trans. Comput. Log. 9(4): 28:1-28:45 (2008)

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.