Search the dblp DataBase

Publications of Author

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