首页 | 本学科首页   官方微博 | 高级检索  
     


Reducing the complexity of reductions
Authors:M. Agrawal  E. Allender  R. Impagliazzo  T. Pitassi  S. Rudich
Affiliation:(1) Department of Computer Science, Indian Institute of Technology, Kanpur 208016, India, e-mail: manindra@iitk.ac.in, IN;(2) Department of Computer Science, Rutgers University, Piscataway, NJ 08854-8019, USA, e-mail: allender@cs.rutgers.edu, US;(3) Department of Computer Science, University of California, San Diego, CA 92093-0114, USA, e-mail: russell@cs.ucsd.edu, US;(4) Department of Computer Science, University of Toronto, Toronto, Ontario M5S 3G4, Canada, e-mail: toni@cs.toronto.edu, CA;(5) Department of Computer Science, Carnegie Mellon University, Pittsburgh, PA 15213-3891, USA, e-mail: rudich@cs.cmu.edu, US
Abstract:
Keywords:. Isomorphisms, completeness, constant-depth circuits, Berman—  Hartmanis Conjecture, powering in finite fields.
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号