A transfer method from bounded existential Diophantine equations to Tarski algebra formulas

We identify a transfer method from bounded existentially quantified Diophantine equations to formulas of Tarski algebra, the first order theory of the real field. The method is applied to show that NP is contained in ⋃n=1∞Dtime(2a⋅logO(1)n), where a depends only on the given Diophantine equation....

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Theoretical computer science Ročník 708; s. 91 - 95
Hlavný autor: Litow, B.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Elsevier B.V 17.01.2018
Predmet:
Bounded existential Diophantine equations
Size bounded quadratic residue problem
Subexponential time algorithms
Tarski algebra
Subexponential time algorithms
Size bounded quadratic residue problem
Bounded existential Diophantine equations
Tarski algebra
ISSN:0304-3975, 1879-2294
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract We identify a transfer method from bounded existentially quantified Diophantine equations to formulas of Tarski algebra, the first order theory of the real field. The method is applied to show that NP is contained in ⋃n=1∞Dtime(2a⋅logO(1)n), where a depends only on the given Diophantine equation.
AbstractList We identify a transfer method from bounded existentially quantified Diophantine equations to formulas of Tarski algebra, the first order theory of the real field. The method is applied to show that NP is contained in ⋃n=1∞Dtime(2a⋅logO(1)n), where a depends only on the given Diophantine equation.
Author Litow, B.
Author_xml – sequence: 1
  givenname: B.
  surname: Litow
  fullname: Litow, B.
  email: bruce.litow@gmail.com
  organization: Portland, OR 97206, United States
BookMark eNp9kMtOwzAQRS1UJNrCB7DzDyT4kcSJWFXlKVViU1YsLMcZU5fGLraL4O9xVdbMZmaudEajM0MT5x0gdE1JSQltbrZl0rFkhIq8l4TyMzSlregKxrpqgqaEk6rgnagv0CzGLclVi2aK3hY4BeWigYBHSBs_YBP8iHt_cAMMGL5tTOCSVTt8Z_1-o_LsAMPnQSXrXcTJ47UK8cNitXuHPihsfBgPOxUv0blRuwhXf32OXh_u18unYvXy-LxcrArNqi4VQ6sa0mrKtO54zWtDTS1EX9eEi5YZpVnPO2Bdo9ucGkH7tiOkrygD1dSm53NET3d18DEGMHIf7KjCj6REHu3Ircx25NHOMcp2MnN7YiA_9mUhyKgtOA2DDaCTHLz9h_4FDC9wWA
Cites_doi 10.1051/ita:2001119
10.1016/S0747-7171(88)80006-3
10.1016/S0022-0000(02)00025-9
10.4064/fm-17-1-210-239
10.1016/0022-0000(78)90044-2
ContentType Journal Article
Copyright 2017 Elsevier B.V.
Copyright_xml – notice: 2017 Elsevier B.V.
DBID AAYXX
CITATION
DOI 10.1016/j.tcs.2017.10.013
DatabaseName CrossRef
DatabaseTitle CrossRef
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Mathematics
Computer Science
EISSN 1879-2294
EndPage 95
ExternalDocumentID 10_1016_j_tcs_2017_10_013
S0304397517307417
GroupedDBID --K
--M
-~X
.DC
.~1
0R~
123
1B1
1RT
1~.
1~5
4.4
457
4G.
5VS
7-5
71M
8P~
9JN
AABNK
AACTN
AAEDW
AAFTH
AAIAV
AAIKJ
AAKOC
AALRI
AAOAW
AAQFI
AAXUO
AAYFN
ABAOU
ABBOA
ABJNI
ABMAC
ABVKL
ABYKQ
ACAZW
ACDAQ
ACGFS
ACRLP
ACZNC
ADBBV
ADEZE
AEBSH
AEKER
AENEX
AEXQZ
AFKWA
AFTJW
AGUBO
AGYEJ
AHHHB
AHZHX
AIALX
AIEXJ
AIKHN
AITUG
AJBFU
AJOXV
ALMA_UNASSIGNED_HOLDINGS
AMFUW
AMRAJ
AOUOD
ARUGR
AXJTR
BKOJK
BLXMC
CS3
DU5
EBS
EFJIC
EFLBG
EJD
EO8
EO9
EP2
EP3
F5P
FDB
FEDTE
FIRID
FNPLU
FYGXN
G-Q
GBLVA
GBOLZ
HVGLF
IHE
IXB
J1W
KOM
LG9
M26
M41
MHUIS
MO0
N9A
O-L
O9-
OAUVE
OK1
OZT
P-8
P-9
P2P
PC.
Q38
RIG
ROL
RPZ
SCC
SDF
SDG
SES
SPC
SPCBC
SSV
SSW
SSZ
T5K
TN5
WH7
YNT
ZMT
~G-
29Q
9DU
AAEDT
AAQXK
AATTM
AAXKI
AAYWO
AAYXX
ABDPE
ABEFU
ABFNM
ABWVN
ABXDB
ACLOT
ACNNM
ACRPL
ACVFH
ADCNI
ADMUD
ADNMO
ADVLN
AEIPS
AEUPX
AFJKZ
AFPUW
AGHFR
AGQPQ
AIGII
AIIUN
AKBMS
AKRWK
AKYEP
ANKPU
APXCP
ASPBG
AVWKF
AZFZN
CITATION
EFKBS
FGOYB
G-2
HZ~
R2-
SEW
TAE
WUQ
ZY4
~HD
ID FETCH-LOGICAL-c249t-d8a608c12cc93535f1f577b5503782fac2b39e296c87b5f71b8900b412ea65fb3
ISICitedReferencesCount 0
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000424074500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0304-3975
IngestDate Sat Nov 29 05:15:28 EST 2025
Fri Feb 23 02:30:24 EST 2024
IsPeerReviewed true
IsScholarly true
Keywords Subexponential time algorithms
Size bounded quadratic residue problem
Bounded existential Diophantine equations
Tarski algebra
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-c249t-d8a608c12cc93535f1f577b5503782fac2b39e296c87b5f71b8900b412ea65fb3
PageCount 5
ParticipantIDs crossref_primary_10_1016_j_tcs_2017_10_013
elsevier_sciencedirect_doi_10_1016_j_tcs_2017_10_013
PublicationCentury 2000
PublicationDate 2018-01-17
PublicationDateYYYYMMDD 2018-01-17
PublicationDate_xml – month: 01
  year: 2018
  text: 2018-01-17
  day: 17
PublicationDecade 2010
PublicationTitle Theoretical computer science
PublicationYear 2018
Publisher Elsevier B.V
Publisher_xml – name: Elsevier B.V
References Matiyasevich (br0070) 1993
Skolem (br0080) 1950
Cormen, Leiserson, Rivest, Stein (br0030) 2009
Hesse, Allender, Mix Barrington (br0050) 2002; 65
Manders, Adleman (br0060) 1978; 16
Tarski (br0090) 1931; 17
Basu, Pollack, Roy (br0010) 2006
van Heijenoort (br0110) 1977
Tarski (br0100) 1948
Grigoriev (br0040) 1988; 5
Chiu, Davida, Litow (br0020) 2001; 35
Matiyasevich (10.1016/j.tcs.2017.10.013_br0070) 1993
Tarski (10.1016/j.tcs.2017.10.013_br0090) 1931; 17
Cormen (10.1016/j.tcs.2017.10.013_br0030) 2009
Skolem (10.1016/j.tcs.2017.10.013_br0080) 1950
Hesse (10.1016/j.tcs.2017.10.013_br0050) 2002; 65
Chiu (10.1016/j.tcs.2017.10.013_br0020) 2001; 35
Grigoriev (10.1016/j.tcs.2017.10.013_br0040) 1988; 5
Manders (10.1016/j.tcs.2017.10.013_br0060) 1978; 16
van Heijenoort (10.1016/j.tcs.2017.10.013_br0110) 1977
Basu (10.1016/j.tcs.2017.10.013_br0010) 2006
Tarski (10.1016/j.tcs.2017.10.013_br0100) 1948
References_xml – year: 2009
  ident: br0030
  article-title: Introduction to Algorithms
– volume: 16
  start-page: 168
  year: 1978
  end-page: 184
  ident: br0060
  article-title: NP-complete decision problems for binary quadratics
  publication-title: J. Comput. System Sci.
– year: 1950
  ident: br0080
  article-title: Diophantische Gleichungen
– year: 1993
  ident: br0070
  article-title: Hilbert's Tenth Problem
– year: 1977
  ident: br0110
  article-title: From Frege to Gödel: A Source Book in Mathematical Logic, 1879–1931
– year: 1948
  ident: br0100
  article-title: A Decision Method for Elementary Algebra and Geometry
– year: 2006
  ident: br0010
  article-title: Algorithms in Real Algebraic Geometry
– volume: 5
  start-page: 65
  year: 1988
  end-page: 108
  ident: br0040
  article-title: Complexity of deciding Tarski algebra
  publication-title: J. Symbolic Comput.
– volume: 35
  start-page: 259
  year: 2001
  end-page: 275
  ident: br0020
  article-title: Division in logspace-uniform
  publication-title: Theor. Inform. Appl.
– volume: 17
  year: 1931
  ident: br0090
  article-title: Sur les ensembles définissables de nombres réels
  publication-title: Fund. Math.
– volume: 65
  start-page: 695
  year: 2002
  end-page: 716
  ident: br0050
  article-title: Uniform constant-depth threshold circuits for division and iterated multiplication
  publication-title: J. Comput. System Sci.
– volume: 35
  start-page: 259
  year: 2001
  ident: 10.1016/j.tcs.2017.10.013_br0020
  article-title: Division in logspace-uniform NC1
  publication-title: Theor. Inform. Appl.
  doi: 10.1051/ita:2001119
– volume: 5
  start-page: 65
  year: 1988
  ident: 10.1016/j.tcs.2017.10.013_br0040
  article-title: Complexity of deciding Tarski algebra
  publication-title: J. Symbolic Comput.
  doi: 10.1016/S0747-7171(88)80006-3
– year: 1977
  ident: 10.1016/j.tcs.2017.10.013_br0110
– year: 2006
  ident: 10.1016/j.tcs.2017.10.013_br0010
– year: 1950
  ident: 10.1016/j.tcs.2017.10.013_br0080
– year: 2009
  ident: 10.1016/j.tcs.2017.10.013_br0030
– year: 1993
  ident: 10.1016/j.tcs.2017.10.013_br0070
– year: 1948
  ident: 10.1016/j.tcs.2017.10.013_br0100
– volume: 65
  start-page: 695
  issue: 4
  year: 2002
  ident: 10.1016/j.tcs.2017.10.013_br0050
  article-title: Uniform constant-depth threshold circuits for division and iterated multiplication
  publication-title: J. Comput. System Sci.
  doi: 10.1016/S0022-0000(02)00025-9
– volume: 17
  year: 1931
  ident: 10.1016/j.tcs.2017.10.013_br0090
  article-title: Sur les ensembles définissables de nombres réels
  publication-title: Fund. Math.
  doi: 10.4064/fm-17-1-210-239
– volume: 16
  start-page: 168
  year: 1978
  ident: 10.1016/j.tcs.2017.10.013_br0060
  article-title: NP-complete decision problems for binary quadratics
  publication-title: J. Comput. System Sci.
  doi: 10.1016/0022-0000(78)90044-2
SSID ssj0000576
Score 2.1945033
Snippet We identify a transfer method from bounded existentially quantified Diophantine equations to formulas of Tarski algebra, the first order theory of the real...
SourceID crossref
elsevier
SourceType Index Database
Publisher
StartPage 91
SubjectTerms Bounded existential Diophantine equations
Size bounded quadratic residue problem
Subexponential time algorithms
Tarski algebra
Title A transfer method from bounded existential Diophantine equations to Tarski algebra formulas
URI https://dx.doi.org/10.1016/j.tcs.2017.10.013
Volume 708
WOSCitedRecordID wos000424074500007&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVESC
  databaseName: Elsevier SD Freedom Collection Journals 2021
  customDbUrl:
  eissn: 1879-2294
  dateEnd: 20180131
  omitProxy: false
  ssIdentifier: ssj0000576
  issn: 0304-3975
  databaseCode: AIEXJ
  dateStart: 19950109
  isFulltext: true
  titleUrlDefault: https://www.sciencedirect.com
  providerName: Elsevier
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3Pb9MwFLZQtwMcGBug_WLygRNVqjhOavtY0CaYYOIwpEo7RLZxxApKuzZF-_P3XmxnYWwSO3CJWkt123xPz-_lfe99hLy13FRcQ3aiIRpJcmGxvitYwrWRAsu5RreqJZ_F2ZmcTtXXIHS5auUERF3L62u1-K9QwxqAja2zj4C72xQW4DWADleAHa7_BPwEZR8gGHXLIA_tW0gM6idBdImjLxukCLX-br74oVErwg3d1Tqw4lAMBtLdn5dD1ACBbLrtcFz_CjyiWWdfXQekDdIQw3CediwfcBdt6ej9qP90gSGxLfHNlLGrCisnyqubRI8pUtnzeV5tK5yeXjHzL7_sHxHMRo3FEelMjJBR55tQ_5yBfeds6hiDkYw2K2GLEreA92WKesUbmSiUHJCNyafj6entMVwIX6gOfyCWtFty353fcX9Q0gs0zl-Q5yFDoBOP7DZ54uodshXVN2hwxjvk2Zdu4u7qJbmY0Ag79bBThJ0G2GkPdtqDnXaw02ZOPew0wE4j7K_It5Pj8w8fkyCckVjIppvku9TjVFqWWat4wYuKVYUQBpJRDgFhpW1muHKZGlsJq5VgRqo0NTnLnB4XleGvyaCe126XUAhewEMXuTOS5UxpaaXJUysh8dW64m6PvIt3rlz4-Sjlg1jtkTze2zIYpA_cSrCThz-2_5jvOCBPb-34kAya5dq9IZv2d3O5Wh4FI7kBhBRyYQ
linkProvider Elsevier
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+transfer+method+from+bounded+existential+Diophantine+equations+to+Tarski+algebra+formulas&rft.jtitle=Theoretical+computer+science&rft.au=Litow%2C+B.&rft.date=2018-01-17&rft.issn=0304-3975&rft.volume=708&rft.spage=91&rft.epage=95&rft_id=info:doi/10.1016%2Fj.tcs.2017.10.013&rft.externalDBID=n%2Fa&rft.externalDocID=10_1016_j_tcs_2017_10_013
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0304-3975&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0304-3975&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0304-3975&client=summon