Nearly Tight Bounds for Testing Function Isomorphism

doi 10.1137/1.9781611973082.130

Full Text

Abstract

Available in

Date

Authors

Publisher

Society for Industrial and Applied Mathematics

Related search

Tight Bounds for Testing Bipartiteness in General Graphs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2003English

Lower Bounds for Subgraph Isomorphism

2019English

Bounds for Nearly Best Approximations

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1975English

Tight Bounds for Adopt-Commit Objects

Theory of Computing Systems
Computational TheoryTheoretical Computer ScienceMathematics
2013English

Fast Algorithm for Graph Isomorphism Testing

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2009English

Tight Bounds for Parallel Randomized Load Balancing

2011English

Nearly Sharp Complexity Bounds for Multiprocessor Algebraic Computations

Journal of Complexity
ControlNumerical AnalysisStatisticsProbabilityAlgebraApplied MathematicsNumber TheoryOptimizationMathematics
1997English

Tight Worst-Case Bounds for Polynomial Loop Programs

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2019English

Tight Approximation Bounds for Greedy Frugal Coverage Algorithms

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2011English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy