default search action

combined dblp search
author search
venue search
publication search

ask others

"Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds."

Rahul Santhanam (2012)

> Home

Details and statistics

DOI: —

access: open

type: Journal Article

metadata version: 2021-02-12

- view
  - electronic edition @ eatcs.org (open access)
- export record
  dblp key:
  - journals/eatcs/Santhanam12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eatcs/Santhanam12
Rahul Santhanam:
Ironic Complicity: Satisfiability Algorithms and Circuit Lower Bounds. Bull. EATCS 106: 31-52 (2012)

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.