"Boolean complexity classes vs. their arithmetic analogs."

Anna Gál, Avi Wigderson (1996)

> Home

Details and statistics

DOI: 10.1002/(SICI)1098-2418(199608/09)9:1/2<99::AID-RSA7>3.0.CO;2-6

access: closed

type: Journal Article

metadata version: 2017-05-26

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/rsa/GalW96
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rsa/GalW96
Anna Gál, Avi Wigderson:
Boolean complexity classes vs. their arithmetic analogs. Random Struct. Algorithms 9(1-2): 99-111 (1996)

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.