Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

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

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

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-11

- view
  - electronic edition @ uchicago.edu (open access)
- export record
  dblp key:
  - journals/cjtcs/ArvindSV02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cjtcs/ArvindSV02
Vikraman Arvind, K. V. Subrahmanyam, N. V. Vinodchandran:
The Query Complexity of Program Checking by Constant-Depth Circuits. Chic. J. Theor. Comput. Sci. 2002 (2002)

a service of

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.