Mihai Prunescu

dblp:60/1925 · DBLP profile ↗
← Back
12ranked-venue papers
12as first author
4since 2021 · last 2026
0000-0003-1627-050XORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 11 first-author · 3 since 2021Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021
YearPublicationVenuePosition
2026 A minimal substitution basis for the Kalmár elementary functions
abstract
Abstract We show that the class of Kalmár elementary functions can be inductively generated from the addition, the integer remainder and the base-two exponentiation, hence improving previous results by Marchenkov and Mazzanti. We also prove that the substitution basis defined by these three operations is minimal. Furthermore, we discuss alternative substitution bases under arity constraints.
Mihai Prunescu, Lorenzo Sauras Altuzarra, Joseph M. Shunia
J. Log. Comput.1
2025 On other two representations of the C-recursive integer sequences by terms in modular arithmetic
Mihai Prunescu
J. Symb. Comput.1
2025 Computational considerations on the representation of number-theoretic functions by arithmetic terms
abstract
Abstract We present closed forms for several functions that are fundamental in number theory and we explain the method used to obtain them. Concretely, we find formulas for the $ p $-adic valuation, the number-of-divisors function, the sum-of-divisors function, Euler’s totient function, the modular inverse, the integer part of the root, the integer part of the logarithm, the multiplicative order and the discrete logarithm. Although these are very complicated, they only involve elementary operations, and, to our knowledge, no other closed form of this kind is known for the aforementioned functions. AMS Subject Classification: 11A25 (primary), 03D20, 03D55
Mihai Prunescu, Lorenzo Sauras Altuzarra
J. Log. Comput.1
2021 Smooth approximations by continuous choice-functions
Mihai Prunescu
Soft Comput.1
2020 THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$
abstract
Abstract We show that the set of natural numbers has an exponential diophantine definition in the rationals. It follows that the corresponding decision problem is undecidable.
Mihai Prunescu
J. Symb. Log.1
2014 A two-valued recurrent double sequence that is not automatic
Mihai Prunescu
Theor. Comput. Sci.1
2006 Fast Quantifier Elimination Means P = NP
Mihai Prunescu
CiE1
2006 Structure with fast elimination of quantifiers
abstract
Abstract A structure of finite signature is constructed so that: for all existential formulas and for all tuples of elements of the same length as the tuple one can decide in a quadratic time depending only on the length of the formula, if holds in the structure. In other words, the structure satisfies the relativized model-theoretic version of P=N P in the sense of [4]. This is a model-theoretical approach to results of Hemmerling and Gaßner.
Mihai Prunescu
J. Symb. Log.1
2005 Two situations with unit-cost: ordered abelian semi-groups and some commutative rings
Mihai Prunescu
J. Complex.1
2002 A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups
abstract
Abstract We give a model-theoretic proof of the fact that for all infinite Abelian groups P ≠ NP in the sense of binary nondeterminism. This result has been announced 1994 by Christine Gaßner.
Mihai Prunescu
J. Symb. Log.1
2002 An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic
abstract
Abstract We use a new version of the Definability Theorem of Beth in order to unify classical theorems of Yuri Matiyasevich and Jan Denef in one structural statement. We give similar forms for other important definability results from Arithmetic and Number Theory.
Mihai Prunescu
J. Symb. Log.1
2001 P != NP for the Reals with Various Analytic Functions
Mihai Prunescu
J. Complex.1