Manindra Agrawal
Eric Allender
- Ag95.M. Agrawal, DSPA CE(n)~ NSPA CE(n) - A degree theoretic characterization, in Proc. 10th Structure in Complexity Theory Conference (1995) pp. 315- 323. Google Scholar
Digital Library
- AA96.M. Agrawal and E. Allender, An Isomorphism Theorem for Circuit Complexity, in Proc. l lth Annum IEEE Conference on Computational Complexity (1996) pp. 2-11. Google ScholarDigital Library
- Aj83.M. Ajtai, Ei formulae on finite structures, Annals of Pure and Applied Logic 24, 1-48.Google Scholar
- Al89.E. AUender, P-uniform circuit complexity, J. ACM 36 ( 1989 ) 912-928. Google ScholarDigital Library
- ABI93.E. Allender, N. lmmerman, and J. Balc~zar, A first-order isomorphism theorem, to appear in SIAM Journal on Computing. A preliminary version appeared in Proc. 10th Symposium on Theoretical Aspects of Computer Science, 1993, Lecture Notes in Computer Science 665, pp. 163-174. Google ScholarDigital Library
- AG91.E. Allender and V. Gore, Rudimentary reductions revisited, Information Processing Letters 40 (1991) 89-95.Google ScholarCross Ref
- AS92.N. Alon and J. Spencer, The Probabilistic Method, John Wiley and Sons, (1992).Google Scholar
- Ar95.Sanjeev Arora, A C~-reductions cannot prove the PUP theorem, manuscript, 1995.Google Scholar
- BDG88.J. Balc~izar, J. Diaz, and J. Gabarr6, Structural Complexity { and II, Springer-Verlag, 1988, 1990. Google ScholarDigital Library
- BIS90.David Mix Barrington, Neil lmmerman, Howard Straubing, On Uniformity Within NCl, J. Computer Sys. Sci. 41 (1990), 274-306. Google ScholarDigital Library
- BH77.L. Berman and J. Hartmanis, On isomorphism and density of NP and other complete sets, SIAM J. Comput. 6 (1977) 305-322.Google ScholarCross Ref
- FSS84.Merrick Furst, James Saxe, and Michael Sipser, Parity, Circuits, and the Polynomial-Time Hierarchy, Math. Systems Theory 17 (1984), 13-27.Google ScholarCross Ref
- Hå87.J. Hfi.stad, One-Way Permutations in NG~, Information Processing Letters 26 (1987), 153-155. Google ScholarDigital Library
- HILL90.J. Hb. stad, R. lmpagliazzo, L. Levin, and M. Luby, Construction of a pseudo-random generator from any one.way function, ICSI Technical Report, No. 91-068 (1990).Google Scholar
- Jo75.Neil Jones, Space. Bounded Reducibility among Combinatorial Problems, J. Computer Sys. Sci. 11 (1975), 68-85.Google ScholarDigital Library
- JY85.D. Joseph and P. Young, Some remarks on witness functions for non-polynomial and non-complete sets in NP, Theoretical Computer Science 39 (1985) 225-237.Google ScholarCross Ref
- J72.J. Justesen, A class of constructive asymptotically good algebraic codes, IEEE Trans. Inform. Theory, 18 (1972), 652-656.Google ScholarCross Ref
- KLD86.Ker-i Ko, Timothy J. Long, and Ding-Zhu Du, On one-way functions and polynomial-time isomorphisms, Theoretical Computer Science 47 (1986) 263-276. Google ScholarDigital Library
- KMR90.S. Kurtz, S. Mahaney, and J. Royer, The structure of complete degrees, in A. Selman, editor, Complexity Theory Retrospective, Springer-Verlag, 1990, pp. 108-146.Google ScholarCross Ref
- KMR95.S. Kurtz, S. Mahaney, and J. Royer, The isomorphism conjecture fails relative to a random oracle, J. ACM 42 (1995), 401-420. Google ScholarDigital Library
- Li94.Steven Linden, How to define exponentiation ,from addition and multiplication in first-order logic on .finite structures, (manuscript). This improves an earlier characterization that appears in: Steven Linde!l, A purely logical characterization of circuit uniformity, Proc. 7th Structure in Complexity Theory Conference (1992) pp. 185-192.Google Scholar
- Ni92.Noam Nisan, Using Hard Problems to Create Pseu. dorandom Generators, MIT Press (1992). Google ScholarDigital Library
- Se92.A. Selman, A survey of one way functions in complexity theory, Mathematical Systems Theory 25 (1992) 203-221.Google ScholarCross Ref
Index Terms
- Reducing the complexity of reductions
Recommendations
Reducing global reductions in large-scale distributed training
ICPP Workshops '19: Workshop Proceedings of the 48th International Conference on Parallel ProcessingCurrent large-scale training of deep neural networks typically employs synchronous stochastic gradient descent that incurs large communication overhead. Instead of optimizing reduction routines as done in recent studies, we propose algorithms that do ...
Query-monotonic Turing reductions
We study reductions that limit the extreme adaptivity of Turing reductions. In particular, we study reductions that make a rapid, structured progression through the set to which they are reducing: Each query is strictly longer (shorter) than the ...
Comments