Complexity with Rod

DOI10.1007/978-3-319-50062-1_8MaRDI QIDQ2970952zbMATH OpenOpenAlexFDO

Authors Lance Fortnow

Publication date 4 April 2017

Published in Computability and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-50062-1_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Biographies, obituaries, personalia, bibliographies (01A70)

Recommendations

• Complexity and multiple complexes
• The Complexity of Complexity
• scientific article; zbMATH DE number 3936654
• Complexity and dimension
• scientific article; zbMATH DE number 558376
• Complexity and structure
• Complexity and momentum
• scientific article; zbMATH DE number 1124602
• A further work on directed rods
• Complex dynamics

Cites work

• scientific article; zbMATH DE number 4091484 (Why is no real title available?)
• scientific article; zbMATH DE number 1497858 (Why is no real title available?)
• Algorithmic randomness and complexity.
• Infeasibility of instance compression and succinct PCPs for NP
• New limits to classical and quantum instance compression
• New non-uniform lower bounds for uniform classes
• On problems without polynomial kernels
• On the Structure of Polynomial Time Reducibility
• On the compressibility of \(\mathcal{NP}\) instances and cryptographic applications
• Recursively enumerable sets of positive integers and their decision problems
• Uniformly hard languages.

Cited in

(2)

• Surfing with Rod
• Lessons I learned from Richard Stanley

This page was built for publication: Complexity with Rod

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2970952)