Reducing the complexity of reductions

@article{Agrawal2001ReducingTC,
  title={Reducing the complexity of reductions},
  author={Manindra Agrawal and Eric Allender and Russell Impagliazzo and Toniann Pitassi and Steven Rudich},
  journal={computational complexity},
  year={2001},
  volume={10},
  pages={117-138}
}
Abstract. We build on the recent progress regarding isomorphisms of complete sets that was reported in Agrawal et al. (1998). In that paper, it was shown that all sets that are complete under (non-uniform) AC0 reductions are isomorphic under isomorphisms computable and invertible via (non-uniform) depth-three AC0 circuits. One of the main tools in proving the isomorphism theorem in Agrawal et al. (1998) is a “Gap Theorem”, showing that all sets complete under AC0 reductions are in fact already… 
Comparing Reductions to NP-Complete Sets
TLDR
Under the assumption that NP does not have p-measure 0, reductions to NP-complete sets are investigated and it is proved that adaptive reductions are more powerful than nonadaptive reductions and every problem that is complete for NE is complete under one-to-one, length-increasing reductions that are computed by polynomial-size circuits.
Verifying proofs in constant depth
TLDR
This paper investigates the question which languages admit proof systems in this very restricted model of proof systems where verification of proofs proceeds by NC0 circuits and shows that even easy regular languages such as Exact-OR do not admit NC0 proof systems.
Verifying proofs in constant depth
TLDR
This paper investigates the question which languages admit proof systems in this very restricted model of NC0, and shows that even easy regular languages such as Exact-OR do not admit NC0 proof systems.
On the (Non) NP-Hardness of Computing Circuit Complexity
TLDR
It is shown that MCSP is provably not NP-hard under O(n1/2-e)-time projections, and it is proved that the Σ2P-hardness of NMCSP, even under arbitrary polynomial-time reductions, would imply EXP ⊄ P/poly.
A Functorial Approach to Reductions among Decision Problems
TLDR
Characterizing complexity classes is not enough; structural complexity theorists are looking for lower bounds, and logical characterizations are good at giving us information about the structure of the programs corresponding to a certain complexity, but it is this latter information that is missing in the question of proving lower bounds.
The Complexity of Membership Problems for Circuits over Sets of Positive Numbers
TLDR
It is shown that the membership problem for the general case and for (∪∩,+,×) is PSPACE-complete, whereas it is NEXPTIME-hard if one allows 0, and several other cases are resolved.
Uniform constant-depth threshold circuits for division and iterated multiplication
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time
  • R. Servedio, Li-Yang Tan
  • Computer Science, Mathematics
    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS)
  • 2017
TLDR
A deterministic algorithm is given which, given an n-variable CNF formula F that has at least ≥ 2^n satisfying assignments, runs in time and outputs a satisfying assignment of F.
Local Reductions
TLDR
For any time T ≥ n and parameter r ≤ n the authors obtain log2 |φ| = max(log T, n/r)+O (log n)+O(log log T ) and each output bit of C is a decision tree of log2.
...
1
2
...

References

SHOWING 1-10 OF 18 REFERENCES
Reductions in Circuit Complexity: An Isomorphism Theorem and a Gap Theorem
TLDR
The Gap Theorem does not hold for strongly uniform reductions; it is shown that there are Dlogtime-uniformAC0-complete sets forNC1 that are not Dlog time- uniformNC0- complete.
Succinct Representation, Leaf Languages, and Projection Reductions
TLDR
For all syntactic complexity classes there exist complete problems under monotone projection reductions, and this positively answers a question by Stewart for a large number of complexity classes.
On Isomorphisms and Density of NP and Other Complete Sets
TLDR
It is shown that complete sets in EXPTIME and EXPTAPE cannot be sparse and therefore they cannot be over a single letter alphabet, and the hardest context-sensitive languages can be sparse.
Space-Bounded Reducibility among Combinatorial Problems
  • N. Jones
  • Computer Science, Mathematics
    J. Comput. Syst. Sci.
  • 1975
P-uniform circuit complexity
TLDR
P-uniform NC (PUNC) is characterized in terms of space-bounded AuxPDAs and alternating Turing Machines with bounded access to the input and the notions of general-purpose and special-purpose computation are considered.
On Uniformity within NC¹
Some Results on Uniform Arithmetic Circuit Complexity
TLDR
It is shown that AE coincides with the class of functions that are computable with constant depth and polynomial size unbounded fan-in arithmetic circuits satisfying a natural uniformity constraint (DLOGTIME-uniformity).
Division Is in Uniform TC0
TLDR
It is shown that indeed division is in uniform TC° and a key step of the proof is the discovery of a first-order formula expressing exponentiation modulo any number of polynomial size.
The First-Order Isomorphism Theorem
For any class C und closed under NC1 reductions, it is shown that all sets complete for C under first-order (equivalently, Dlogtime-uniform AC0) reductions are isomorphic under first-order computable
On uniformity within NC/sup 1/
TLDR
It is shown that the two notions of uniformity are equivalent, leading to a natural notion of uniformities for low-level circuit complexity classes, and that recent results on the structure of NC/sup 1/ still hold true in this very uniform setting.
...
1
2
...