"The Complexity of Membership Problems for Circuits over Sets of Integers."

Stephen D. Travers (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-28629-5_23

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-25

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/Travers04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/Travers04
Stephen D. Travers:
The Complexity of Membership Problems for Circuits over Sets of Integers. MFCS 2004: 322-333

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.