A manifesto for the computational method
From MaRDI portal
Publication:1603721
DOI10.1016/S0304-3975(01)00078-0zbMath0996.68183MaRDI QIDQ1603721
Publication date: 15 July 2002
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Unnamed Item
- Unnamed Item
- An algorithmic proof theory for hypergeometric (ordinary and ``\(q\)) multisum/integral identities
- New algorithms for an ancient scheduling problem.
- Improved bounds for harmonic-based bin packing algorithms
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- Randomized competitive algorithms for the list update problem
- Online randomized multiprocessor scheduling
- Modular elliptic curves and Fermat's Last Theorem
- Ring-theoretic properties of certain Hecke algebras
- Making sense of experimental mathematics
- Chaos in the Lorenz equations: a computer-assisted proof
- Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
- Gadgets, Approximation, and Linear Programming
- A Better Algorithm for an Ancient Scheduling Problem
- Multiprocessor Scheduling with Rejection
- On-Line Load Balancing for Related Machines
- Computer-Assisted Proofs in Analysis and Programming in Logic: A case Study
- Counterexample to Euler’s conjecture on sums of like powers
- A Counterexample to Euler's Sum of Powers Conjecture
- Bounds for Certain Multiprocessing Anomalies
- On Computable Numbers, with an Application to the Entscheidungsproblem
This page was built for publication: A manifesto for the computational method
