Article

Nonrelativizing Separations

Authors:

H. Buhrman,

L. Fortnow,

T. ThieraufAuthors Info & Claims

COCO '98: Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity

Page 8

Published: 15 June 1998 Publication History

Publisher Site

Abstract

No abstract available.

Cited By

View all

Buhrman HTorenvliet LUnger FVereshchagin N(2019)Sparse Selfreducible Sets and Nonuniform Lower BoundsAlgorithmica10.1007/s00453-018-0439-081:1(179-200)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00453-018-0439-0
Impagliazzo RKabanets VVolkovich IServedio R(2018)The power of natural properties as oraclesProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235593(1-20)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235593
Aydinlioğlu BBach E(2018)Affine RelativizationACM Transactions on Computation Theory10.1145/317070410:1(1-67)Online publication date: 24-Jan-2018
https://dl.acm.org/doi/10.1145/3170704
Show More Cited By

Nonrelativizing Separations
1. Computing methodologies
  1. Artificial intelligence
  2. Computer graphics
    1. Image manipulation
2. Software and its engineering
  1. Software notations and tools
    1. General programming languages

Recommendations

Nonrelativizing Separations
Separations in query complexity using cheat sheets
STOC '16: Proceedings of the forty-eighth annual ACM symposium on Theory of Computing

We show a power 2.5 separation between bounded-error randomized and quantum query complexity for a total Boolean function, refuting the widely believed conjecture that the best such separation could only be quadratic (from Grover's algorithm). We also ...
New separations results for external information
STOC 2021: Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing

We obtain new separation results for the two-party external information complexity of Boolean functions. The external information complexity of a function f(x,y) is the minimum amount of information a two-party protocol computing f must reveal to an ...

Comments

Information & Contributors

Information

Published In

COCO '98: Proceedings of the Thirteenth Annual IEEE Conference on Computational Complexity

June 1998

ISBN:0818683953

Publisher

IEEE Computer Society

United States

Publication History

Published: 15 June 1998

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Buhrman HTorenvliet LUnger FVereshchagin N(2019)Sparse Selfreducible Sets and Nonuniform Lower BoundsAlgorithmica10.1007/s00453-018-0439-081:1(179-200)Online publication date: 1-Jan-2019
https://dl.acm.org/doi/10.1007/s00453-018-0439-0
Impagliazzo RKabanets VVolkovich IServedio R(2018)The power of natural properties as oraclesProceedings of the 33rd Computational Complexity Conference10.5555/3235586.3235593(1-20)Online publication date: 22-Jun-2018
https://dl.acm.org/doi/10.5555/3235586.3235593
Aydinlioğlu BBach E(2018)Affine RelativizationACM Transactions on Computation Theory10.1145/317070410:1(1-67)Online publication date: 24-Jan-2018
https://dl.acm.org/doi/10.1145/3170704
Oliveira ISanthanam R(2017)Conspiracies between learning algorithms, circuit lower bounds, and pseudorandomnessProceedings of the 32nd Computational Complexity Conference10.5555/3135595.3135613(1-49)Online publication date: 9-Jul-2017
https://dl.acm.org/doi/10.5555/3135595.3135613
Williams R(2016)Strong ETH breaks with Merlin and ArthurProceedings of the 31st Conference on Computational Complexity10.5555/2982445.2982447(1-17)Online publication date: 29-May-2016
https://dl.acm.org/doi/10.5555/2982445.2982447
Murray CWilliams RZuckerman D(2015)On the (non) NP-hardness of computing circuit complexityProceedings of the 30th Conference on Computational Complexity10.5555/2833227.2833245(365-380)Online publication date: 17-Jun-2015
https://dl.acm.org/doi/10.5555/2833227.2833245
Williams R(2014)Nonuniform ACC Circuit Lower BoundsJournal of the ACM10.1145/255990361:1(1-32)Online publication date: 1-Jan-2014
https://dl.acm.org/doi/10.1145/2559903
Benedikt MLenhardt RWorrell J(2011)Two variable vs. linear temporal logic in model checking and gamesProceedings of the 22nd international conference on Concurrency theory10.5555/2040235.2040278(497-511)Online publication date: 6-Sep-2011
https://dl.acm.org/doi/10.5555/2040235.2040278
Fortnow LSanthanam R(2011)Robust simulations and significant separationsProceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I10.5555/2027127.2027188(569-580)Online publication date: 4-Jul-2011
https://dl.acm.org/doi/10.5555/2027127.2027188
Williams R(2011)Guest columnACM SIGACT News10.1145/2034575.203459142:3(54-76)Online publication date: 14-Oct-2011
https://dl.acm.org/doi/10.1145/2034575.2034591
Show More Cited By

Abstract

Cited By

Recommendations

Nonrelativizing Separations

Separations in query complexity using cheat sheets

New separations results for external information

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations