skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


This content will become publicly available on July 4, 2025

Title: On Oracles and Algorithmic Methods for Proving Lower Bounds
Award ID(s):
2127597
PAR ID:
10579537
Author(s) / Creator(s):
;
Publisher / Repository:
Electronic Colloquium on Computational Complexity
Date Published:
Page Range / eLocation ID:
TR24-113
Format(s):
Medium: X
Institution:
Massachusetts Institute of Technology
Sponsoring Org:
National Science Foundation
More Like this
No document suggestions found
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email