Skip to main content

ResearchHubLoading navigation…

Loading ResearchHub…

Explore the network

Research, people, journals and institutions — all in one place.

Explore

01Research 02Smart search 03Researchers 04Journals 05Institutions 06RHR Rankings 07ResearchHub platform 08Events

Work together

Turn ideas into projects, questions and reusable datasets.

Connect

01Projects 02Questions 03Datasets

Stay informed

Follow trends, opportunities and your research library.

Insights

01Research trends 02Opportunities 03Library 04Research services 05ResearchHub Pro 06Pricing

ResearchHub

Explore ResearchHub.

Personal

01Recommended research 02Research intelligence

Home Search Network Library Log in

computational complexity - ResearchHub

ResearchHub

Research, connected

Explore the graph

X

Download ResearchHub

GET IT ONGoogle PlayComing soonDownload on theApp StoreComing soonEXPLORE IT ONAppGalleryComing soon

Research

Research Researchers Journals Institutions RHR Rankings

Contribute

Projects Questions Datasets Opportunities

Platform

ResearchHub platform About Blog Community Help API Licensing

Shopping

Contact and support

Need help, have a question, or want to contact the ResearchHub team?

Contact and support support@aresearch.uk

© 2026 ResearchHub. Built for responsible scholarly connection.

Help Article feed Privacy Terms Cookies This work is licensed under Creative Commons Attribution 4.0 InternationalCC BY 4.0

Privacy-aware community infrastructure

Journal

computational complexity

1016-3328 · Springer Science and Business Media LLC

101 verified public works

Browse all journals →

Special Issue “Computational Complexity Conference 2023” Guest Editors’ Foreword

2026 · 0 citations

Valiant?s model and the cost of computing integers

2005 · 0 citations

The complexity of constructing pseudorandom generators from hard functions

2005 · 0 citations

On the complexity of computing determinants

2005 · 0 citations

Derandomizing Polynomial Identity Tests Means Proving Circuit Lower Bounds

2004 · 0 citations

Non-Automatizability of Bounded-Depth Frege Proofs

2004 · 0 citations

Recursion Schemata for Slowly Growing Depth Circuit Classes

2004 · 0 citations

On the complexity of vertex-disjoint length-restricted path problems

2003 · 0 citations

Deterministic polynomial-time quantum algorithms for Simon?s problem

2003 · 0 citations

Straight-line programs and torsion points on elliptic curves

2003 · 0 citations

Uniform hardness versus randomness tradeoffs for Arthur-Merlin games

2003 · 0 citations

On the complexity of simulating space-bounded quantum computations

2003 · 0 citations

Complexity of some arithmetic problems for binary polynomials

2003 · 0 citations

Towards proving strong direct product theorems

2003 · 0 citations

Homogenization and the polynomial calculus

2002 · 0 citations

The complexity of tensor calculus

2002 · 0 citations

On interactive proofs with a laconic prover

2002 · 0 citations

On the hardness of approximating the permanent of structured matrices

2002 · 0 citations

Hard examples for the bounded depth Frege proof system

2002 · 0 citations

Separability and one-way functions

2002 · 0 citations

Complexity of Positivstellensatz proofs for the knapsack

2001 · 0 citations

Communication complexity towards lower bounds on circuit depth

2001 · 0 citations

Derandomizing Arthur--Merlin games under uniform assumptions

2001 · 0 citations

Two oracles that force a big crunch

2001 · 0 citations

On the size of randomized OBDDs and read-once branching programs for k -stable functions

2001 · 0 citations

Reducing the complexity of reductions

2001 · 0 citations

A complexity gap for tree resolution

2001 · 0 citations

Pseudorandom functions in $ \textit{TC}^{0} $ and cryptographic limitations to proving lower bounds

2001 · 0 citations

Errata for: "On randomized one-round communication complexity"

2001 · 0 citations

A characterization of span program size and improved lower bounds for monotone span programs

2001 · 0 citations

Page 1 of 4Next