The following pages link to Klaus Meer (Q418113):
Displayed 50 items.
- On Ladner's result for a class of real machines with restricted use of constants (Q418114) (← links)
- On the expressive power of CNF formulas of bounded tree- and clique-width (Q617890) (← links)
- Real computational universality: the word problem for a class of groups with infinite presentation (Q734136) (← links)
- Computations over \(\mathbb{Z}\) and \(\mathbb{R}\): a comparison (Q923632) (← links)
- On the OBDD size for graphs of bounded tree- and clique-width (Q1011721) (← links)
- A note on a \(P \neq NP\) result for a restricted class of real machines (Q1203647) (← links)
- A survey on real structural complexity theory (Q1280231) (← links)
- (Q1311386) (redirect page) (← links)
- Real number models under various sets of operations (Q1311387) (← links)
- On the complexity of quadratic programming in real number models of computation (Q1338219) (← links)
- Real number computations: On the use of information (Q1346475) (← links)
- Semi-algebraic complexity -- Additive complexity of matrix computational tasks (Q1361878) (← links)
- Counting problems over the reals (Q1575534) (← links)
- On the computational structure of the connected components of a hard problem (Q1607000) (← links)
- On a refined analysis of some problems in interval arithmetic using real number complexity theory (Q1826441) (← links)
- Some aspects of studying an optimization or decision problem in different computational models (Q1848391) (← links)
- A note on testing the resultant (Q1908893) (← links)
- A PCP of proximity for real algebraic polynomials (Q2117096) (← links)
- An extended tree-width notion for directed graphs related to the computation of permanents (Q2254501) (← links)
- Automata over infinite sequences of reals (Q2278268) (← links)
- Periodic generalized automata over the reals (Q2280333) (← links)
- Interactive proofs and a Shamir-like result for real number computations (Q2323360) (← links)
- Generalized finite automata over real and complex numbers (Q2354406) (← links)
- The PCP theorem for NP over the reals (Q2355329) (← links)
- Simulated annealing versus Metropolis for a TSP instance (Q2380026) (← links)
- An algebraic proof of the real number PCP theorem (Q2396715) (← links)
- An explicit solution to Post's problem over the reals (Q2479313) (← links)
- Transparent long proofs: A first PCP theorem for \(\text{NP}_{\mathbb R}\) (Q2505647) (← links)
- Some relations between approximation problems and PCPs over the real numbers (Q2642900) (← links)
- Computing minimal multi-homogeneous Bezout numbers is hard (Q2643147) (← links)
- (Q2753688) (← links)
- Periodic Generalized Automata over the Reals (Q2798718) (← links)
- An Algebraic Proof of the Real Number PCP Theorem (Q2946376) (← links)
- The PCP theorem for NP over the reals (Q2957875) (← links)
- An Extended Tree-Width Notion for Directed Graphs Related to the Computation of Permanents (Q3007631) (← links)
- Almost Transparent Short Proofs for NPℝ (Q3088268) (← links)
- Some Results on Interactive Proofs for Real Computations (Q3195685) (← links)
- Two logical hierarchies of optimization problems over the real numbers (Q3376539) (← links)
- On the OBDD Size for Graphs of Bounded Tree- and Clique-Width (Q3499725) (← links)
- Real Computational Universality: The Word Problem for a Class of Groups with Infinite Presentation (Q3525615) (← links)
- Tree-width in Algebraic Complexity (Q3561221) (← links)
- On Ladner’s Result for a Class of Real Machines with Restricted Use of Constants (Q3576067) (← links)
- On the Structure of $\cal NP_\Bbb C$ (Q4210134) (← links)
- (Q4234078) (← links)
- Logics which capture complexity classes over the reals (Q4254641) (← links)
- (Q4361549) (← links)
- (Q4409153) (← links)
- (Q4502591) (← links)
- Real Interactive Proofs for VPSPACE. (Q4608572) (← links)
- (Q4699316) (← links)