Pages that link to "Item:Q1327451"
From MaRDI portal
The following pages link to Computability and complexity of ray tracing (Q1327451):
Displaying 6 items.
- On the complexity of nonuniform wavelength-based machine (Q256966) (← links)
- Masking traveling beams: optical solutions for NP-complete problems, trading space for time (Q847661) (← links)
- Can Newtonian systems, bounded in space, time, mass and energy compute all functions? (Q870250) (← links)
- Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
- Closed-form analytic maps in one and two dimensions can simulate universal Turing machines (Q1274815) (← links)
- Reachability analysis of dynamical systems having piecewise-constant derivatives (Q1367528) (← links)
