Pages that link to "Item:Q1280231"

The following pages link to A survey on real structural complexity theory (Q1280231):

Displaying 32 items.

• On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
• A weak version of the Blum, Shub, and Smale model (Q676432) (← links)
• A note on a theorem of Blum, Shub, and Smale (Q909656) (← links)
• Physically-relativized Church-Turing hypotheses: physical foundations of computing and complexity theory of computational physics (Q1036536) (← links)
• Computability of a map and decidability of its graph in the model of Blum, Shub and Smale (Q1127553) (← links)
• Recursively enumerable subsets of \(\mathbb{R}^{q}\) in two computing models Blum-Shub-Smale machine and Turing machine (Q1128664) (← links)
• Achilles and the tortoise climbing up the hyper-arithmetical hierarchy (Q1274806) (← links)
• Real number models under various sets of operations (Q1311387) (← links)
• On the computational power of dynamical systems and hybrid systems (Q1349871) (← links)
• On the relations between distributive computability and the BSS model (Q1349919) (← links)
• Elimination of constants from machines over algebraically closed fields (Q1361877) (← links)
• On NP-completeness for linear machines (Q1368835) (← links)
• Counting problems over the reals (Q1575534) (← links)
• Isomorphism theorem for BSS recursively enumerable sets over real closed fields (Q1575912) (← links)
• On the computational structure of the connected components of a hard problem (Q1607000) (← links)
• A topological view on algebraic computation models (Q1679677) (← links)
• On weak-space complexity over complex numbers (Q1679984) (← links)
• A survey of recursive analysis and Moore's notion of real computation (Q1761708) (← links)
• Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
• Characterization of realizable space complexities (Q1892934) (← links)
• Computing over the reals with addition and order: Higher complexity classes (Q1908895) (← links)
• On the expressiveness and decidability of o-minimal hybrid systems (Q2387414) (← links)
• \(\mathbf P =\mathbf{NP}\) for some structures over the binary words (Q2387422) (← links)
• Two situations with unit-cost: ordered abelian semi-groups and some commutative rings (Q2387423) (← links)
• An explicit solution to Post's problem over the reals (Q2479313) (← links)
• Average-Price and Reachability-Price Games on Hybrid Automata with Strong Resets (Q3543289) (← links)
• (Q4781604) (← links)
• Kolmogorov Complexity Theory over the Reals (Q4918012) (← links)
• Logics which capture complexity classes over the reals (Q5055931) (← links)
• Computational complexity in algebraic systems (Q5476780) (← links)
• Logical Approaches to Computational Barriers (Q5898821) (← links)
• On weak and weighted computations over the real closure of \(\mathbb{Q}\) (Q5941734) (← links)