Dieter van Melkebeek

◀ ▶ joint publications with Baris Aydinlioglu

> Home > Persons > Dieter van Melkebeek

Publications

2017
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/cc/AydinliogluM17
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/cc/AydinliogluM17
Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic circuit lower bounds from mildly derandomizing Arthur-Merlin games. Comput. Complex. 26(1): 79-118 (2017)
2012
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/coco/AydinliogluM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/coco/AydinliogluM12
Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic Circuit Lower Bounds from Mildly De-randomizing Arthur-Merlin Games. CCC 2012: 269-279
[i25]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/AydinliogluM12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AydinliogluM12
Baris Aydinlioglu, Dieter van Melkebeek:
Nondeterministic Circuit Lower Bounds from Mildly Derandomizing Arthur-Merlin Games. Electron. Colloquium Comput. Complex. TR12 (2012)
2010
[i22]
- view
  - electronic edition @ weizmann.ac.il (open access)
  - no references & citations available
- export record
  dblp key:
  - journals/eccc/AaronsonABHM10
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/eccc/AaronsonABHM10
Scott Aaronson, Baris Aydinlioglu, Harry Buhrman, John M. Hitchcock, Dieter van Melkebeek:
A note on exponential circuit lower bounds from derandomizing Arthur-Merlin games. Electron. Colloquium Comput. Complex. TR10 (2010)

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.