Pages that link to "Item:Q1077163"
From MaRDI portal
The following pages link to The complexity of analog computation (Q1077163):
Displaying 30 items.
- Solving the generalized subset sum problem with a light based device (Q537835) (← links)
- More about NP-completeness in the frustration model of spin-glasses (Q580185) (← links)
- A universal scaling theory for complexity of analog computation (Q716028) (← links)
- Exact cover with light (Q732172) (← links)
- Unbounded hardware is equivalent to deterministic Turing machines (Q789180) (← links)
- Computability of analog networks (Q870263) (← links)
- Analog computation through high-dimensional physical chaotic neuro-dynamics (Q933433) (← links)
- The nature of the extended analog computer (Q933439) (← links)
- Solving the subset-sum problem with a light-based device (Q1024028) (← links)
- Checking local optimality in constrained quadratic programming is NP- hard (Q1102861) (← links)
- On the global minimization of a convex function under general nonconvex constraints (Q1111474) (← links)
- Some mathematical limitations of the general-purpose analog computer (Q1124392) (← links)
- Analog computation via neural networks (Q1331940) (← links)
- Unconventional complexity measures for unconventional computers (Q1761690) (← links)
- An analog characterization of the Grzegorczyk hierarchy (Q1872639) (← links)
- How quantum is the speedup in adiabatic unstructured search? (Q2100794) (← links)
- A neural sorting network with O(1) time complexity (Q2365819) (← links)
- Random matrix theory for the analysis of the performance of an analog computer: a scaling theory (Q2383193) (← links)
- On the computational power of molecular heat engines (Q2492778) (← links)
- How much can analog and hybrid systems be proved (super-)Turing (Q2497875) (← links)
- Bit copying: the ultimate computational simplicity (Q2888174) (← links)
- Towards an Axiomatization of Simple Analog Algorithms (Q2898065) (← links)
- Digital simulation of analog computation and Church's thesis (Q4732471) (← links)
- A Survey on Analog Models of Computation (Q5024572) (← links)
- Efficient simulation scheme for a class of quantum optics experiments with non-negative Wigner representation (Q5141408) (← links)
- Physical Computational Complexity and First-order Logic (Q5158662) (← links)
- Analog reducibility (Q5163980) (← links)
- (Q5493754) (← links)
- Iteration, inequalities, and differentiability in analog computers (Q5925968) (← links)
- Theoretical computer science: computational complexity (Q6602263) (← links)
