Optimal series-parallel trade-offs for reducing a function to its own graph
From MaRDI portal
Recommendations
Cites work
- A comparison of polynomial time reducibilities
- A note on enumerative counting
- A taxonomy of complexity classes of functions
- Approximable sets
- Bounded queries to SAT and the Boolean hierarchy
- Bounded Query Classes
- Enumerative counting is hard
- scientific article; zbMATH DE number 3557240 (Why is no real title available?)
- scientific article; zbMATH DE number 1222608 (Why is no real title available?)
- scientific article; zbMATH DE number 512801 (Why is no real title available?)
- scientific article; zbMATH DE number 3399210 (Why is no real title available?)
- On polynomial-time truth-table reducibility of intractable sets to P-selective sets
- On the complexity of ranking
- P-selective sets, tally languages, and the behavior of polynomial time reducibilities onNP
- Polynomial-Time Membership Comparable Sets
- Quasi-linear truth-table reductions to \(p\)-selective sets
- Relative complexity of checking and evaluating
- Some connections between bounded query classes and non-uniform complexity.
- The complexity of optimization problems
- The difference and truth-table hierarchies for NP
- The strong exponential hierarchy collapses
This page was built for publication: Optimal series-parallel trade-offs for reducing a function to its own graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854508)
