Time-Space Lower Bounds for the Polynomial-Time Hierarchy on Randomized Machines

Lecture Notes in Computer Science - Germany
doi 10.1007/11523468_79
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Springer Berlin Heidelberg

Related search

Comparison-Based Time–Space Lower Bounds for Selection

2009English

Lower Bounds on the Broadcasting and Gossiping Time of Restricted Protocols

SIAM Journal on Discrete Mathematics
Mathematics
2004English

Lower Bounds for Solving Linear Diophantine Equations on Random Access Machines

Journal of the ACM
ControlSystems EngineeringInformation SystemsHardwareArchitectureArtificial IntelligenceSoftware
1985English

Minimizing Average Flow-Time : Upper and Lower Bounds

Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS
Computer NetworksOpticsMolecular Physics,CommunicationsOpticalAtomicMagnetic MaterialsElectronic
2007English

A Hierarchy of Lower Bounds for Sublinear Additive Spanners

2017English

Tight Lower Bounds for the Workflow Satisfiability Problem Based on the Strong Exponential Time Hypothesis

Information Processing Letters
Signal ProcessingComputer Science ApplicationsInformation SystemsTheoretical Computer Science
2016English

Lower and Upper Bounds for the Time Constant of First-Passage Percolation

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2002English

Space Lower Bounds for Itemset Frequency Sketches

2016English

With Probability One, a Random Oracle Separates PSPACE From the Polynomial-Time Hierarchy

1986English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy