Mihai Prunescu

30 papers C 1Misc 1Journal 23Unranked 4
YearRankTypeTitle / Venue / Authors
2026 J jnl
A minimal substitution basis for the Kalmár elementary functions.
J. Log. Comput.
Mihai Prunescu, Lorenzo Sauras Altuzarra, Joseph M. Shunia
2025 J jnl
A Minimal Substitution Basis for the Kalmar Elementary Functions.
CoRR
Mihai Prunescu, Lorenzo Sauras Altuzarra, Joseph M. Shunia
2025 J jnl
Computational considerations on the representation of number-theoretic functions by arithmetic terms.
J. Log. Comput.
Mihai Prunescu, Lorenzo Sauras Altuzarra
2025 J jnl
Conjunctions of exponential diophantine equations over ${\mathbb {Q}}$.
Arch. Math. Log.
Mihai Prunescu
2025 J jnl
On other two representations of the C-recursive integer sequences by terms in modular arithmetic.
J. Symb. Comput.
Mihai Prunescu
2025 — conf
Polynomial Fingerprinting for Trees and Formulas.
FROM
Mihai Prunescu
2025 J jnl
Two-colorings of finite grids: variations on a theorem of Tibor Gallai.
CoRR
Bogdan Dumitru, Mihai Prunescu
2023 — conf
Symmetric Functions over Finite Fields.
FROM
Mihai Prunescu
2023 — conf
Using Z3 to Verify Inferences in Fragments of Linear Logic.
FROM
Alen Docef, Radu Negulescu, Mihai Prunescu
2022 J jnl
On Representations of Intended Structures in Foundational Theories.
J. Philos. Log.
Neil Barton, Moritz Müller, Mihai Prunescu
2021 Misc conf
Secure Multiparty Computation in arbitrary rings.
SYNASC
Mihai Prunescu
2021 J jnl
Smooth approximations by continuous choice-functions.
Soft Comput.
Mihai Prunescu
2020 J jnl
THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$.
J. Symb. Log.
Mihai Prunescu
2014 J jnl
A two-valued recurrent double sequence that is not automatic.
Theor. Comput. Sci.
Mihai Prunescu
2013 J jnl
F
Eur. J. Comb.
Mihai Prunescu
2011 J jnl
Linear Recurrent Double Sequences with Constant Border in
Symmetry
Mihai Prunescu
2009 J jnl
Self-similar carpets over finite fields.
Eur. J. Comb.
Mihai Prunescu
2008 J jnl
An Undecidable Property of Recurrent Double Sequences.
Notre Dame J. Formal Log.
Mihai Prunescu
2006 C conf
Fast Quantifier Elimination Means P = NP.
CiE
Mihai Prunescu
2006 J jnl
Structure with fast elimination of quantifiers.
J. Symb. Log.
Mihai Prunescu
2006 J jnl
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions.
Math. Log. Q.
Mihai Prunescu
2005 — conf
The Symmetric Subset-Sum Problem over the Complex Numbers.
Algorithmic Algebra and Logic
Mihai Prunescu
2005 J jnl
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings.
J. Complex.
Mihai Prunescu
2003 J jnl
Diophantine properties of finite commutative rings.
Arch. Math. Log.
Mihai Prunescu
2003 J jnl
P != NP for all infinite Boolean algebras.
Math. Log. Q.
Mihai Prunescu
2002 J jnl
A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups.
J. Symb. Log.
Mihai Prunescu
2002 J jnl
An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic.
J. Symb. Log.
Mihai Prunescu
2001 J jnl
Non-effective Quantifier Elimination.
Math. Log. Q.
Mihai Prunescu
2001 J jnl
P != NP for the Reals with Various Analytic Functions.
J. Complex.
Mihai Prunescu
1999 — —
A structural approach to diophantine definability.
Mihai Prunescu