• Home
• Call for Papers
• Reports
  • A-Z
  • 2025
  • 2024
  • 2023
  • 2025...1994
  • Keywords
• Authors
• Books + Lectures
  • Monographs
  • Lecture Notes
  • Online Lectures
  • Survey Papers
  • Theses
  • Position papers
• About ECCC
  • Call for Papers
  • How to use
  • Scientific Board
  • Local Office
  • Copyright Notice
  • Read more...
• Pointers to
  • Books
  • Lecture Notes
  • Surveys
  • Home pages of theorists
  • Current discussions
  • ECCC Impressions
• Further links
  • Bibliography Data Bases
  • Mathematical Resources
  • Journals
  • People
  • Preprint Servers
  • Electronic Forums
• Newsletter

Actual Discussions

• A polynomial time algorithm for computing the permanent in GF(3^q)
  Vadim Tarin, claiming the non-uniform equality between P and NP, or that RP = NP
  • Comment: Problem with Vadim Tarin's NP=RP Proof
    Charanjit Jutla
• Theory of Computation: Goals and Perspective
  Materials of a ACM workshop on Strategic Directions in Computing Research