Computability and complexity of ray tracing
From MaRDI portal
Publication:1327451
DOI10.1007/BF02574009zbMath0807.68096OpenAlexW2056721503MaRDI QIDQ1327451
Publication date: 1 March 1995
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/131302
Related Items (6)
Masking traveling beams: optical solutions for NP-complete problems, trading space for time ⋮ Reachability analysis of dynamical systems having piecewise-constant derivatives ⋮ Can Newtonian systems, bounded in space, time, mass and energy compute all functions? ⋮ Closed-form analytic maps in one and two dimensions can simulate universal Turing machines ⋮ Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics ⋮ On the complexity of nonuniform wavelength-based machine
Cites Work
- Relationships between nondeterministic and deterministic tape complexities
- A rational billiard flow is uniquely ergodic in almost every direction
- Time/Space Trade-Offs for Reversible Computation
- Period Three Implies Chaos
- Unpredictability and undecidability in dynamical systems
- Ergodic theory of chaos and strange attractors
- Reducibility among Combinatorial Problems
- Deterministic Simulation of Random Processes
- Logical Reversibility of Computation
- Billiards in polygons
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Computability and complexity of ray tracing
