scientific article; zbMATH DE number 2097995

zbMATH Open1051.03029MaRDI QIDQ4814348

Vladimír Glasnák

Publication date: 7 September 2004

Full work available at URL: https://eudml.org/doc/22528

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Title of this publication is not available (Why is that?)

zbMATH Keywords

computational complexityreducibilitysparse setpadded set

Mathematics Subject Classification ID

Complexity of computation (including implicit computational complexity) (03D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Other degrees and reducibilities in computability and recursion theory (03D30)

Related Items (1)

Quasi-linear truth-table reductions to \(p\)-selective sets

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Bounds in weak truth-table reducibility 👍 👎
• Deterministic and randomized bounded truth-table reductions of P, NL, and L to sparse sets 👍 👎
• On polynomial-time truth-table reducibility of intractable sets to P-selective sets 👍 👎
• Two Results on Polynomial Time Truth-Table Reductions to Sparse Sets 👍 👎
• On Certain Polynomial-Time Truth-Table Reducibilities of Complete Sets to Sparse Sets 👍 👎
• Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets 👍 👎
• On sets bounded truth-table reducible to $P$-selective sets 👍 👎
• A Note on Bounded-Truth-Table Reducibility 👍 👎

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4814348)