Остановите войну!
for scientists:
default search action
Mihai Prunescu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1999
- [b1]Mihai Prunescu:
A structural approach to diophantine definability. University of Konstanz, Germany, Konstanzer Schriften in Mathematik und Informatik / Universität Konstanz / Fakultät für Mathematik und Informatik 87, 1999, pp. I-IX, 1-69
Journal Articles
- 2022
- [j17]Neil Barton, Moritz Müller, Mihai Prunescu:
On Representations of Intended Structures in Foundational Theories. J. Philos. Log. 51(2): 283-296 (2022) - 2021
- [j16]Mihai Prunescu:
Smooth approximations by continuous choice-functions. Soft Comput. 25(21): 13277-13286 (2021) - 2020
- [j15]Mihai Prunescu:
THE EXPONENTIAL DIOPHANTINE PROBLEM FOR ${\mathbb {Q}}$. J. Symb. Log. 85(2): 671-672 (2020) - 2014
- [j14]Mihai Prunescu:
A two-valued recurrent double sequence that is not automatic. Theor. Comput. Sci. 528: 32-39 (2014) - 2013
- [j13]Mihai Prunescu:
Fp-affine recurrent n-dimensional sequences over Fq are p-automatic. Eur. J. Comb. 34(2): 260-284 (2013) - 2011
- [j12]Mihai Prunescu:
Linear Recurrent Double Sequences with Constant Border in M2(F2) are Classified According to Their Geometric Content. Symmetry 3(3): 402-442 (2011) - 2009
- [j11]Mihai Prunescu:
Self-similar carpets over finite fields. Eur. J. Comb. 30(4): 866-878 (2009) - 2008
- [j10]Mihai Prunescu:
An Undecidable Property of Recurrent Double Sequences. Notre Dame J. Formal Log. 49(2): 143-151 (2008) - 2006
- [j9]Mihai Prunescu:
Structure with fast elimination of quantifiers. J. Symb. Log. 71(1): 321-328 (2006) - [j8]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
- [j7]Mihai Prunescu:
Two situations with unit-cost: ordered abelian semi-groups and some commutative rings. J. Complex. 21(4): 579-592 (2005) - 2003
- [j6]Mihai Prunescu:
Diophantine properties of finite commutative rings. Arch. Math. Log. 42(3): 293-302 (2003) - [j5]Mihai Prunescu:
P != NP for all infinite Boolean algebras. Math. Log. Q. 49(2): 210-213 (2003) - 2002
- [j4]Mihai Prunescu:
A Model-Theoretic Proof for P unequal to NP over All Infinite Abelian Groups. J. Symb. Log. 67(1): 235-238 (2002) - [j3]Mihai Prunescu:
An Isomorphism Between Monoids of External Embeddings: About Definability in Arithmetic. J. Symb. Log. 67(2): 598-620 (2002) - 2001
- [j2]Mihai Prunescu:
P != NP for the Reals with Various Analytic Functions. J. Complex. 17(1): 17-26 (2001) - [j1]Mihai Prunescu:
Non-effective Quantifier Elimination. Math. Log. Q. 47(4): 557-561 (2001)
Conference and Workshop Papers
- 2023
- [c5]Alen Docef, Radu Negulescu, Mihai Prunescu:
Using Z3 to Verify Inferences in Fragments of Linear Logic. FROM 2023: 11-25 - [c4]Mihai Prunescu:
Symmetric Functions over Finite Fields. FROM 2023: 131-143 - 2021
- [c3]Mihai Prunescu:
Secure Multiparty Computation in arbitrary rings. SYNASC 2021: 283-290 - 2006
- [c2]Mihai Prunescu:
Fast Quantifier Elimination Means P = NP. CiE 2006: 459-470 - 2005
- [c1]Mihai Prunescu:
The Symmetric Subset-Sum Problem over the Complex Numbers. Algorithmic Algebra and Logic 2005: 201-206
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint