A hierarchy for nondeterministic time complexity

[PDF] gi.de

[图书][B] Query answering in probabilistic data and knowledge bases

II Ceylan - 2018 - dl.gi.de
Probabilistische Datenbanken und Wissensbasen werden immer wichtiger in der
Wissenschaft und Industrie. Sie werden ständig mit neuen Daten erweitert, angetrieben …
被引用次数：14 相关文章 所有 5 个版本
[HTML] sciencedirect.com

[HTML][HTML] Local reduction

H Jahanjou, E Miles, E Viola - Information and Computation, 2018 - Elsevier
We reduce non-deterministic time T≥ 2 n to a 3SAT instance ϕ of quasilinear size| ϕ|= T⋅
log O (1)⁡ T such that there is an explicit NC 0 circuit C that encodes ϕ in the following way …
被引用次数：6 相关文章 所有 3 个版本

Bounded-Depth Succinct Encodings and the Structure they Imply on Graphs

P Scharpfenecker - Theory of Computing Systems, 2018 - Springer
We study the complexity of graph problems succinctly encoded by bounded depth circuits
and the existence of upward translation theorems for these models. While almost all succinct …
被引用次数：1 相关文章 所有 5 个版本

[引用][C] The solution of the 3rd clay millennium problem. A short proof that P≠ NP= EXPTIME in the contex of zermelofrankel set theory.

KE Kyritsis - 2018
被引用次数：8 相关文章

[引用][C] The coin problem in constant depth: Sample complexity and parity gates

N Limaye, K Sreenivasiah, S Srinivasan, U Tripathi… - Electronic Colloquium on …, 2018
被引用次数：8 相关文章

[引用][C] Proving that prBPP= prP is as hard as “almost” proving that P= NP

R Tell - Electronic Colloquium on Computational Complexity …, 2018
被引用次数：3 相关文章

[引用][C] THE SOLUTION OF THE 3 RD CLAY MILLENNIUM PROBLEM. A SHORT PROOF THAT P not equal to NP= EXPTIME IN THE CONTEXT OF ZERMELO …

KE Kyritsis - 2018
相关文章