对于实际的不确定多时间blum - shub - small机床，交叉乘积项是完全可满足的

Machines, Computations, and Universality Pub Date : 2013-09-05 DOI:10.4204/EPTCS.128.16

C. Herrmann, Johanna Sokoli, M. Ziegler

{"title":"对于实际的不确定多时间blum - shub - small机床，交叉乘积项是完全可满足的","authors":"C. Herrmann, Johanna Sokoli, M. Ziegler","doi":"10.4204/EPTCS.128.16","DOIUrl":null,"url":null,"abstract":"Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. We exhibit a new one based on questions about expressions built from cross products only.","PeriodicalId":340847,"journal":{"name":"Machines, Computations, and Universality","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines\",\"authors\":\"C. Herrmann, Johanna Sokoli, M. Ziegler\",\"doi\":\"10.4204/EPTCS.128.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. We exhibit a new one based on questions about expressions built from cross products only.\",\"PeriodicalId\":340847,\"journal\":{\"name\":\"Machines, Computations, and Universality\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Machines, Computations, and Universality\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4204/EPTCS.128.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Machines, Computations, and Universality","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4204/EPTCS.128.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 4

摘要

实数上的不确定性多项式时间Blum-Shub-Smale机器产生了一个介于NP和PSPACE之间的离散复杂度类。几个问题，大多来自真实的代数几何/多项式系统，已经被证明是完整的(在多项式时间图灵机的多一约简下)。我们展示了一个基于仅由交叉产品构建的表达式的问题的新问题。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Satisfiability of cross product terms is complete for real nondeterministic polytime Blum-Shub-Smale machines

Nondeterministic polynomial-time Blum-Shub-Smale Machines over the reals give rise to a discrete complexity class between NP and PSPACE. Several problems, mostly from real algebraic geometry / polynomial systems, have been shown complete (under many-one reduction by polynomial-time Turing machines) for this class. We exhibit a new one based on questions about expressions built from cross products only.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Machines, Computations, and Universality

自引率

0.00%

发文量