Skip to main content
Disciplines
Automotive Business IT + Informatics Construction + Real Estate Electrical Engineering + Electronics Energy + Sustainability Insurance + Risk Finance + Banking Management + Leadership Marketing + Sales Mechanical Engineering + Materials
Events
DE
EN
Books
Journals
Topic Page
Marketing
Start single access now
Access for companies
EXTENDED SEARCH
Log in
Top

computational complexity

Issue 1/2018

Content (4 Articles)

On the hardness of the noncommutative determinant

V. Arvind, Srikanth Srinivasan

Short lists with short programs in short time

Bruno Bauwens, Anton Makhlin, Nikolay Vereshchagin, Marius Zimand

Autoreducibility of NP-Complete Sets under Strong Hypotheses

John M. Hitchcock, Hadi Shafei

Non-interactive proofs of proximity

Tom Gur, Ron D. Rothblum

Dec 17
Issue: 4/2017
Jun 18
Issue: 2/2018

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits