An Average Case Time Complexity Estimator for Black-Box Functions

doi 10.18293/seke2015-213
Full Text
Abstract

Available in full text

Date
Authors
Publisher

KSI Research Inc. and Knowledge Systems Institute Graduate School

Related search

Average-Case Bounds for the Complexity of Path-Search

DIMACS Series in Discrete Mathematics and Theoretical Computer Science
1998English

Notions of Average-Case Complexity for Random 3-Sat

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2004English

Subsampling Mathematical Relaxations and Average-Case Complexity

2011English

Black-Box Circular-Secure Encryption Beyond Affine Functions

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

The Emerging Theory of Average-Case Complexity

1990English

An Algorithm for Finding Nearest Neighbours in Constant Average Time With a Linear Space Complexity

English

Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

INFORMS Journal on Computing
Management ScienceComputer Science ApplicationsInformation SystemsOperations ResearchSoftware
2002English

Opponent Chromatic Response Functions for an Average Observer

Perception & Psychophysics
1979English

Black-Box Non-Black-Box Zero Knowledge

2014English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy