A manifesto for the computational method
From MaRDI portal
Recommendations
Cites work
- A Better Algorithm for an Ancient Scheduling Problem
- A Counterexample to Euler's Sum of Powers Conjecture
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- Bounds for Certain Multiprocessing Anomalies
- Chaos in the Lorenz equations: a computer-assisted proof
- Computer-Assisted Proofs in Analysis and Programming in Logic: A case Study
- Counterexample to Euler’s conjecture on sums of like powers
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Gadgets, Approximation, and Linear Programming
- scientific article; zbMATH DE number 5783650 (Why is no real title available?)
- scientific article; zbMATH DE number 53883 (Why is no real title available?)
- Improved bounds for harmonic-based bin packing algorithms
- Making sense of experimental mathematics
- Modular elliptic curves and Fermat's Last Theorem
- Multiprocessor Scheduling with Rejection
- New algorithms for an ancient scheduling problem.
- On Computable Numbers, with an Application to the Entscheidungsproblem
- On-Line Load Balancing for Related Machines
- Online randomized multiprocessor scheduling
- Randomized competitive algorithms for the list update problem
- Ring-theoretic properties of certain Hecke algebras
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
This page was built for publication: A manifesto for the computational method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1603721)
