"The Query Complexity of Program Checking by Constant-Depth Circuits."

Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran (1999)

> Home

Details and statistics

DOI: 10.1007/3-540-46632-0_13

access: closed

type: Conference or Workshop Paper

metadata version: 2023-05-01

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/ArvindSV99
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ArvindSV99
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. ISAAC 1999: 123-132

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.