"Flat and One-Variable Clauses: Complexity of Verifying Cryptographic ..."

Helmut Seidl, Kumar Neeraj Verma (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-32275-7_6

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/lpar/SeidlV04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/lpar/SeidlV04
Helmut Seidl, Kumar Neeraj Verma:
Flat and One-Variable Clauses: Complexity of Verifying Cryptographic Protocols with Single Blind Copying. LPAR 2004: 79-94

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.