Sparse Complete Sets for NP: Solution of a Conjecture of Berman and Hartmanis

Journal of Computer and System Sciences - United States
doi 10.1016/0022-0000(82)90002-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

Sparse Hard Sets for P: Resolution of a Conjecture of Hartmanis

Journal of Computer and System Sciences
Computer NetworksApplied MathematicsCommunicationsComputational TheoryMathematicsTheoretical Computer Science
1999English

One-Way Functions and the Berman-Hartmanis Conjecture

2009English

Graph Decomposition Is NP-Complete: A Complete Proof of Holyer's Conjecture

SIAM Journal on Computing
MathematicsComputer Science
1997English

Some Observations About NP Complete Sets

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
1987English

NP-Creative Sets: A New Class of Creative Sets in NP

Mathematical Systems Theory
1996English

3R1545 Solution of NP-complete Problems on Hybrid DNA Computer

Seibutsu Butsuri
2002English

Equivalence of Sparse and Carleson Coefficients for General Sets

Arkiv for Matematik
Mathematics
2018English

Testing Orientability for Matroids Is NP-Complete

Advances in Applied Mathematics
Applied Mathematics
1999English

Theory-Contraction Is NP-Complete

Logic Journal of the IGPL
Philosophy
2003English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2026 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy