SPARSE SETS IN NP-P - EXPTIME VERSUS NEXPTIME

被引：48

作者：

HARTMANIS, J

IMMERMAN, N

SEWELSON, V

机构：

[1] YALE UNIV, DEPT MATH, NEW HAVEN, CT 06520 USA

[2] YALE UNIV, DEPT COMP SCI, NEW HAVEN, CT 06520 USA

来源：

INFORMATION AND CONTROL | 1985年 / 65卷 / 2-3期

关键词：

D O I：

10.1016/S0019-9958(85)80004-8

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：158 / 181

页数：24

共 50 条

[41] P-SELECTIVE SETS, TALLY LANGUAGES, AND THE BEHAVIOR OF POLYNOMIAL TIME REDUCIBILITIES ON NP
SELMAN, AL
MATHEMATICAL SYSTEMS THEORY, 1979, 13 (01): : 55 - 65
[42] From P Versus NP to Probabilistic and Zero Knowledge Proof Systems
Drusinsky, Doron
Drusinsky, Doron
COMPUTER, 2024, 57 (04) : 119 - 130
[43] On P versus NP $ \cap $ co-NP for decision trees and read-once branching programs
S. Jukna
A. Razborov
P. Savicky
I. Wegener
computational complexity, 1999, 8 : 357 - 370
[44] Editorial: P versus NP problem from Formal Languages Theory View
Ruiz-Vanoye, Jorge A.
Diaz-Parra, Ocotlan
Rafael Trejo-Macotela, Francisco
Cesar Ramos-Fernandez, Julio
INTERNATIONAL JOURNAL OF COMBINATORIAL OPTIMIZATION PROBLEMS AND INFORMATICS, 2021, 12 (01): : 1 - 8
[45] On P versus NP for parameter-free programs over algebraic structures
Hemmerling, A
MATHEMATICAL LOGIC QUARTERLY, 2001, 47 (01) : 67 - 92
[46] On implications between P-NP-hypotheses:: Decision versus computation in algebraic complexity
Bürgisser, P
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2001, 2001, 2136 : 3 - 17
[47] The P versus NP-complete dichotomy of some challenging problems in graph theory
de Figueiredo, Celina M. H.
DISCRETE APPLIED MATHEMATICS, 2012, 160 (18) : 2681 - 2693
[48] P versus NP and computability theoretic constructions in complexity theory over algebraic structures
Mainhardt, G
JOURNAL OF SYMBOLIC LOGIC, 2004, 69 (01) : 39 - 64
[49] Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets
van Melkebeek, D
JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1998, 57 (02) : 213 - 232
[50] Characterization and recognition of P4-sparse graphs partitionable into k independent sets and l cliques
Bravo, Raquel S. F.
Klein, Sulamita
Nogueira, Loana Tito
Protti, Fabio
DISCRETE APPLIED MATHEMATICS, 2011, 159 (04) : 165 - 173

← 1 2 3 4 5 →