Mihai Prunescu

According to our database, Mihai Prunescu authored at least 23 papers between 1999 and 2023.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2023

Symmetric Functions over Finite Fields.

Mihai Prunescu

Proceedings of the Proceedings 7th Symposium on Working Formal Methods, 2023

Using Z3 to Verify Inferences in Fragments of Linear Logic.

Alen Docef, Radu Negulescu, Mihai Prunescu

Proceedings of the Proceedings 7th Symposium on Working Formal Methods, 2023

2022

On Representations of Intended Structures in Foundational Theories.

Neil Barton, Moritz Müller, Mihai Prunescu

J. Philos. Log., 2022

2021

Smooth approximations by continuous choice-functions.

Mihai Prunescu

Soft Comput., 2021

Secure Multiparty Computation in arbitrary rings.

Mihai Prunescu

Proceedings of the 23rd International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2021

2020

THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$.

Mihai Prunescu

J. Symb. Log., 2020

2014

A two-valued recurrent double sequence that is not automatic.

Mihai Prunescu

Theor. Comput. Sci., 2014

2013

F_p-affine recurrent n-dimensional sequences over F_q are p-automatic.

Mihai Prunescu

Eur. J. Comb., 2013

2011

Linear Recurrent Double Sequences with Constant Border in <i>M</i>₂(F₂) are Classified According to Their Geometric Content.

Mihai Prunescu

Symmetry, 2011

2009

Self-similar carpets over finite fields.

Mihai Prunescu

Eur. J. Comb., 2009

2008

An Undecidable Property of Recurrent Double Sequences.

Mihai Prunescu

Notre Dame J. Formal Log., 2008

2006

Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions.

Mihai Prunescu

Math. Log. Q., 2006

Structure with fast elimination of quantifiers.

Mihai Prunescu

J. Symb. Log., 2006

Fast Quantifier Elimination Means P = NP.

Mihai Prunescu

Proceedings of the Logical Approaches to Computational Barriers, 2006

2005

Two situations with unit-cost: ordered abelian semi-groups and some commutative rings.

Mihai Prunescu

J. Complex., 2005

The Symmetric Subset-Sum Problem over the Complex Numbers.

Mihai Prunescu

Proceedings of the Algorithmic Algebra and Logic. Proceedings of the A3L 2005, 2005

2003

P != NP for all infinite Boolean algebras.

Mihai Prunescu

Math. Log. Q., 2003

Diophantine properties of finite commutative rings.

Mihai Prunescu

Arch. Math. Log., 2003

2002

An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic.

Mihai Prunescu

J. Symb. Log., 2002

A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups.

Mihai Prunescu

J. Symb. Log., 2002

2001

Non-effective Quantifier Elimination.

Mihai Prunescu

Math. Log. Q., 2001

P != NP for the Reals with Various Analytic Functions.

Mihai Prunescu

J. Complex., 2001

1999

A structural approach to diophantine definability.

Mihai Prunescu

PhD thesis, 1999