The following pages link to (Q3992465):
Displaying 50 items.
- On computational complexity of graph inference from counting (Q269786) (← links)
- Numerical solution of certain exponential and non-linear Diophantine systems of equations by using a discrete particle swarm optimization algorithm (Q275842) (← links)
- Undecidability through Fourier series (Q278759) (← links)
- Finding all solutions of equations in free groups and monoids with involution (Q342722) (← links)
- Representation theorems for recursively enumerable sets and a conjecture related to Poonen's large subring of \(\mathbb Q\) (Q393224) (← links)
- Towards finite-fold Diophantine representations (Q393229) (← links)
- Products of matrices and recursively enumerable sets (Q473201) (← links)
- The de Jongh property for basic arithmetic (Q481876) (← links)
- On nonlinear multi-covering problems (Q511715) (← links)
- Quantum revivals of a non-Rabi type in a Jaynes-Cummings model (Q520990) (← links)
- Knapsack problem for nilpotent groups (Q524650) (← links)
- Notes on the computational aspects of Kripke's theory of truth (Q526739) (← links)
- On the decidability of termination of query evaluation in transitive-closure logics for polynomial constraint databases (Q555774) (← links)
- Extending and interpreting Post's programme (Q636317) (← links)
- Recursive analysis of singular ordinary differential equations (Q638473) (← links)
- Macsyma: A personal history (Q655565) (← links)
- Hilbert's tenth problem is of unification type zero (Q688556) (← links)
- Some specially formulated axiomizations for \(\mathrm{I}\Sigma _0\) manage to evade the Herbrandized version of the second incompleteness theorem (Q731897) (← links)
- The computational status of physics (Q734210) (← links)
- On pseudo algebraically closed extensions of fields (Q734764) (← links)
- What can and cannot be done with Diophantine problems (Q741171) (← links)
- Absoluteness of subword inequality is undecidable (Q764348) (← links)
- Learning via finitely many queries (Q812396) (← links)
- Sound and complete qualitative simulation is impossible (Q814512) (← links)
- On the solvability of a class of Diophantine equations and applications (Q818150) (← links)
- Further results on Hilbert's tenth problem (Q829448) (← links)
- Optimization modulo non-linear arithmetic via incremental linearization (Q831943) (← links)
- Graph compression and the zeros of polynomials (Q834888) (← links)
- Affine linear sieve, expanders, and sum-product (Q849252) (← links)
- Mechanically proving termination using polynomial interpretations (Q851142) (← links)
- Inferring answers to queries (Q927868) (← links)
- \(S_{k,\text{exp}}\) does not prove \(\text{NP} = \text{co-NP}\) uniformly (Q937909) (← links)
- FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension (Q948960) (← links)
- On deciding stability of multiclass queueing networks under buffer priority scheduling policies (Q983890) (← links)
- Existential arithmetization of Diophantine equations (Q1006616) (← links)
- A note on commutative multivariate rational series (Q1014441) (← links)
- What is a universal computing machine? (Q1036530) (← links)
- On the theories of free solvable groups (Q1295586) (← links)
- The computational complexity of some problems of linear algebra (Q1307698) (← links)
- A direct method for simulating partial recursive functions by Diophantine equations (Q1326783) (← links)
- Diophantine representations of linear recurrences. I (Q1376907) (← links)
- Hypercomputation with quantum adiabatic processes (Q1434370) (← links)
- Hypercomputation by definition (Q1434375) (← links)
- Constructive mathematics and mathematical logic. Part X. Transl. from the Russian (Q1578747) (← links)
- The computability, definability, and proof theory of Artinian rings (Q1628418) (← links)
- A transfer method from bounded existential Diophantine equations to Tarski algebra formulas (Q1686076) (← links)
- Semiautomatic structures (Q1694004) (← links)
- On two-way nondeterministic finite automata with one reversal-bounded counter (Q1763701) (← links)
- Infiniteness sets of primes, admitting diophantine representations in eight variables (Q1807459) (← links)
- A new technique for obtaining diophantine representations via elimination of bounded universal quantifiers (Q1807463) (← links)
