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 3/2012

Content (6 Articles)

Complexity and Approximability of the Cover Polynomial

Markus Bläser, Holger Dell, Mahmoud Fouz

On reducing factorization to the discrete logarithm problem modulo a composite

Jacek Pomykała, Bartosz Źrałek

On a Theorem of Razborov

Henning Wunderlich

Low-Depth Witnesses are Easy to Find

Luís Antunes, Lance Fortnow, Alexandre Pinto, André Souto

A Quantum Characterization Of NP

Hugue Blier, Alain Tapp

Length 3 Edge-Disjoint Paths Is NP-Hard

Hannah Alpert, Jennifer Iglesias

Jun 12
Issue: 2/2012
Selected papers from the 26th Annual IEEE Conference on Computational Complexity (CCC 2011)
Dec 12
Issue: 4/2012

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits