| 2006 |
|---|
| 9 | EE | Mihai Prunescu:
Fast Quantifier Elimination Means P = NP.
CiE 2006: 459-470 |
| 8 | EE | Mihai Prunescu:
Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions.
Math. Log. Q. 52(1): 14-19 (2006) |
| 2005 |
|---|
| 7 | EE | Mihai Prunescu:
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings.
J. Complexity 21(4): 579-592 (2005) |
| 2003 |
|---|
| 6 | EE | Mihai Prunescu:
Diophantine properties of finite commutative rings.
Arch. Math. Log. 42(3): 293-302 (2003) |
| 5 | EE | Mihai Prunescu:
P != NP for all infinite Boolean algebras.
Math. Log. Q. 49(2): 210-213 (2003) |
| 2002 |
|---|
| 4 | | Mihai Prunescu:
A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups.
J. Symb. Log. 67(1): 235-238 (2002) |
| 3 | | Mihai Prunescu:
An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic.
J. Symb. Log. 67(2): 598-620 (2002) |
| 2001 |
|---|
| 2 | EE | Mihai Prunescu:
P != NP for the Reals with Various Analytic Functions.
J. Complexity 17(1): 17-26 (2001) |
| 1 | EE | Mihai Prunescu:
Non-effective Quantifier Elimination.
Math. Log. Q. 47(4): 557-561 (2001) |
