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

Journal of Computer and System Sciences - United States
doi 10.1006/jcss.1998.1615
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Elsevier BV

Related search

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

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

One-Way Functions and the Berman-Hartmanis Conjecture

2009English

Equivalence of Sparse and Carleson Coefficients for General Sets

Arkiv for Matematik
Mathematics
2018English

Infinite Sidon Sets Contained in Sparse Random Sets of Integers

SIAM Journal on Discrete Mathematics
Mathematics
2018English

A Conjecture of Ore on Chains in Partially Ordered Sets

Bulletin of the American Mathematical Society
1943English

A Dichotomy for P-Ideals of Countable Sets

Fundamenta Mathematicae
Number TheoryAlgebra
2000English

$P\sp{p}$-Conjecture for Locally Compact Groups. I

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1966English

An Algebraic Exploration of Dominating Sets and Vizing's Conjecture

Electronic Journal of Combinatorics
CombinatoricsApplied MathematicsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2012English

A Sparse Regular Sequence of Exponentials Closed on Large Sets

Bulletin of the American Mathematical Society
1964English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy