Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Proof Complexity Lower Bounds from Algebraic Circuit Complexity."

Michael A. Forbes et al. (2016)

> Home

Details and statistics

DOI: 10.4230/LIPICS.CCC.2016.32

access: open

type: Conference or Workshop Paper

metadata version: 2023-06-26

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/coco/ForbesSTW16
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/ForbesSTW16
Michael A. Forbes, Amir Shpilka, Iddo Tzameret, Avi Wigderson:
Proof Complexity Lower Bounds from Algebraic Circuit Complexity. CCC 2016: 32:1-32:17

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.