The following pages link to (Q4286756):
Displayed 38 items.
- Diophantine questions in the class of finitely generated nilpotent groups (Q285579) (← links)
- Quasi-interpretations. A way to control resources (Q541228) (← links)
- Diophantine equations and the generalized Riemann hypothesis (Q548056) (← links)
- Authentication schemes from actions on graphs, groups, or rings (Q638486) (← links)
- \(\text{NP}\not={co}\)-NP and models of arithmetic (Q672454) (← links)
- P, NP, Co-NP and weak systems of arithmetic (Q672742) (← links)
- Uncomputability and undecidability in economic theory (Q1036534) (← links)
- Diophantine undecidability of holomorphy rings of function fields of characteristic 0 (Q1041275) (← links)
- Metafinite model theory (Q1383163) (← links)
- On the computability of Nash equilibria (Q1391660) (← links)
- Frontier between decidability and undecidability: A survey (Q1575913) (← links)
- The complexity of computation and approximation of the \(t\)-ratio over one-dimensional interval data (Q1623689) (← links)
- Semi-Galois categories. II: An arithmetic analogue of Christol's theorem (Q1643559) (← links)
- Hintikka's independence-friendly logic meets Nelson's realizability (Q1653658) (← links)
- A computational glimpse at the Leibniz and Frege hierarchies (Q1676326) (← links)
- Liouville closed \(H\)-fields (Q1772249) (← links)
- Normal forms for second-order logic over finite structures, and classification of NP optimization problems (Q1919763) (← links)
- Turing reducibility in the fine hierarchy (Q2187259) (← links)
- Symmetry of eigenvalues of Sylvester matrices and tensors (Q2197821) (← links)
- Padovan-like sequences and Bell polynomials (Q2228808) (← links)
- Definability and decidability in infinite algebraic extensions (Q2349099) (← links)
- The computational power of enzymatic numerical P systems working in the sequential mode (Q2413310) (← links)
- Extendability of continuous maps is undecidable (Q2441584) (← links)
- Diophantine sets of representations (Q2445923) (← links)
- Isomorphisms of scattered automatic linear orders (Q2446106) (← links)
- Complexity in Young's lattice (Q2668002) (← links)
- Knapsack and subset sum problems in nilpotent, polycyclic, and co-context-free groups (Q2975251) (← links)
- On certain biquadratic equations, II (Q3177708) (← links)
- (Q3305190) (← links)
- Extensions of Hilbert’s Tenth Problem: Definability and Decidability in Number Theory (Q3305316) (← links)
- Theories of orders on the set of words (Q3374756) (← links)
- Decidability of Univariate Real Algebra with Predicates for Rational and Integer Powers (Q3454091) (← links)
- Tree Automata for Non-linear Arithmetic (Q3522025) (← links)
- Size-based termination of higher-order rewriting (Q4577817) (← links)
- (Q4993596) (← links)
- (Q5015397) (← links)
- (Q5129945) (← links)
- (Q5240211) (← links)