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 2/1999

Content (5 Articles)

The complexity of matrix rank and feasible systems of linear equations

E. Allender, R. Beals, M. Ogihara

Lower bounds for the polynomial calculus and the Gröbner basis algorithm

R. Impagliazzo, P. Pudlák, J. Sgall

Randomness complexity of private computation

C. Blundo, A. De Santis, G. Persiano, U. Vaccaro

Adaptive versus nonadaptive queries to NP and p-selective sets

A.V. Naik, A.L. Selman

Feasibly continuous type-two functionals

B.M. Kapron

Jun 99
Issue: 1/1999
Dec 99
Issue: 4/1999

Current Publications

scroll for more

use your arrow keys for more

scroll or use arrow keys for more

Premium Partner

    Image Credits