Mihai Prunescu

ORCID

Publication Activity (10 Years)

Years Active: 2001-2023
Publications (10 Years): 6

Top Venues

University of Konstanz, Germany (PHD)

Education History

University of Konstanz, Germany

PHD

Publications

Mihai Prunescu
Symmetric Functions over Finite Fields. FROM (2023)
Alen Docef, Radu Negulescu, Mihai Prunescu
Using Z3 to Verify Inferences in Fragments of Linear Logic. FROM (2023)
Neil Barton, Moritz Müller, Mihai Prunescu
On Representations of Intended Structures in Foundational Theories. J. Philos. Log. 51 (2) (2022)
Mihai Prunescu
Secure Multiparty Computation in arbitrary rings. SYNASC (2021)
Mihai Prunescu
Smooth approximations by continuous choice-functions. Soft Comput. 25 (21) (2021)
Mihai Prunescu
THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$. J. Symb. Log. 85 (2) (2020)
Mihai Prunescu
A two-valued recurrent double sequence that is not automatic. Theor. Comput. Sci. 528 (2014)
Mihai Prunescu
are p-automatic. Eur. J. Comb. 34 (2) (2013)
Mihai Prunescu
) are Classified According to Their Geometric Content. Symmetry 3 (3) (2011)
Mihai Prunescu
Self-similar carpets over finite fields. Eur. J. Comb. 30 (4) (2009)
Mihai Prunescu
An Undecidable Property of Recurrent Double Sequences. Notre Dame J. Formal Log. 49 (2) (2008)
Mihai Prunescu
Fast Quantifier Elimination Means P = NP. CiE (2006)
Mihai Prunescu
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions. Math. Log. Q. 52 (1) (2006)
Mihai Prunescu
Structure with fast elimination of quantifiers. J. Symb. Log. 71 (1) (2006)
Mihai Prunescu
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings. J. Complex. 21 (4) (2005)
Mihai Prunescu
The Symmetric Subset-Sum Problem over the Complex Numbers. Algorithmic Algebra and Logic (2005)
Mihai Prunescu
Diophantine properties of finite commutative rings. Arch. Math. Log. 42 (3) (2003)
Mihai Prunescu
P != NP for all infinite Boolean algebras. Math. Log. Q. 49 (2) (2003)
Mihai Prunescu
An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic. J. Symb. Log. 67 (2) (2002)
Mihai Prunescu
A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups. J. Symb. Log. 67 (1) (2002)
Mihai Prunescu
Non-effective Quantifier Elimination. Math. Log. Q. 47 (4) (2001)
Mihai Prunescu
P != NP for the Reals with Various Analytic Functions. J. Complex. 17 (1) (2001)

Mihai Prunescu.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Mihai Prunescu