Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
This article was published in an Elsevier journal. The attached copy is furnished to the author for non-commercial research and
 

Summary: This article was published in an Elsevier journal. The attached copy
is furnished to the author for non-commercial research and
education use, including for instruction at the author's institution,
sharing with colleagues and providing to institution administration.
Other uses, including reproduction and distribution, or selling or
licensing copies, or posting to personal, institutional or third party
websites are prohibited.
In most cases authors are permitted to post their version of the
article (e.g. in Word or Tex form) to their personal website or
institutional repository. Authors requiring further information
regarding Elsevier's archiving and manuscript policies are
encouraged to visit:
http://www.elsevier.com/copyright
Author's personal copy
Theoretical Computer Science 385 (2007) 167178
www.elsevier.com/locate/tcs
Polylogarithmic-round interactive proofs for coNP collapse the
exponential hierarchy$
A. Pavana, Alan L. Selmanb, Samik Senguptab, N.V. Vinodchandranc,
a Department of Computer Science, Iowa State University, United States

  

Source: Aduri, Pavan - Department of Computer Science, Iowa State University

 

Collections: Computer Technologies and Information Sciences