No label defined (Q4256063)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1309064
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 1309064 |
Statements
28 June 1999
0 references
Buffalo, NY (USA)
0 references
Proceedings
0 references
Conference
0 references
Computational complexity
0 references
0.96186966
0 references
0.86634254
0 references
0.8606422
0 references
0.8601015
0 references
The articles of this volume will be reviewed individually. Indexed articles: \textit{Sivakumar, D.}, On membership comparable sets, 2-7 [Zbl 0935.68031] \textit{Buhrman, Harry; Fortnow, Lance; Thierauf, Thomas}, Nonrelativizing separations, 8-12 [Zbl 0935.68032] \textit{Buhrman, Harry; Fortnow, Lance}, Two queries, 13-19 [Zbl 0935.68033] \textit{Goldreich, Oded; Sudan, Madhu}, Computational indistinguishability: A sample hierarchy, 24-33 [Zbl 0935.68034] \textit{di Crescenzo, Giovanni; Impagliazzo, Russell}, Proofs of membership vs. proofs of knowledge, 34-45 [Zbl 0935.68096] \textit{Cai, Jin-Yi; Nerurkar, Ajay}, Approximating the SVP to within a factor \((1+\frac{1}{\text{dim}^\varepsilon})\) is NP-hard under randomized reductions, 46-55 [Zbl 0935.68035] \textit{Raz, Ran; Tardos, Gábor; Verbitsky, Oleg; Vereshagin, Nikolai}, Arthur-Merlin games in Boolean decision trees, 58-67 [Zbl 0946.68055] \textit{Beimel, Amos; Gál, Anna}, On arithmetic branching programs, 68-80 [Zbl 0935.68024] \textit{Agrawal, Manindra; Thierauf, Thomas}, The satisfiability problem for probabilistic ordered branching programs, 81-90 [Zbl 0935.68025] \textit{Allender, Eric; Reinhardt, Klaus}, Isolation, matching, and counting, 92-100 [Zbl 0935.68036] \textit{Jenner, Birgit; McKenzie, Pierre; Torán, Jacobo}, A note on the hardness of tree isomorphism, 101-105 [Zbl 0935.68037] \textit{Marathe, Madhav V.; Hunt, Harry B. III; Rosenkrantz, Daniel J.; Stearns, Richard E.}, Theory of periodically specified problems: Complexity and approximability, 106-118 [Zbl 0935.68038] \textit{Spielman, Daniel A.}, Models of computation in coding theory, 120-131 [Zbl 0935.68026] \textit{Veith, Helmut}, How to encode a logical structure by an OBDD, 122-131 [Zbl 0935.68051] \textit{Köbler, Johannes; Messner, Jochen}, Complete problems for promise classes by optimal proof systems for test sets, 132-140 [Zbl 0935.68097] \textit{Klauck, Hartmut}, Lower bounds for computation with limited nondeterminism, 141-152 [Zbl 0935.68027] \textit{Beigel, Richard; Fu, Bin}, Solving intractable problems with DNA computing, 154-168 [Zbl 0935.68028] \textit{Buhrman, H.; van Melkebeek, D.}, Hard sets are hard to find, 170-181 [Zbl 0935.68039] \textit{Köbler, Johannes; Lindner, Wolfgang}, On the resource bounded measure of \(P\)/poly (extended abstract), 182-185 [Zbl 0935.68040] \textit{Regan, Kenneth W.; Sivakumar, D.}, Probabilistic martingales and BPTIME classes, 186-200 [Zbl 0935.68041] \textit{Fortnow, Lance; Rogers, John}, Complexity limitations on quantum computation, 202-209 [Zbl 0935.68042] \textit{Watrous, John}, Relationships between quantum and classical space-bounded complexity classes, 210-227 [Zbl 0935.68043] \textit{Downey, Rod; Fortnow, Lance}, Uniformly hard languages, 228-233 [Zbl 0935.68006] \textit{Lutz, Jack H.}, Resource-bounded measure, 236-248 [Zbl 0935.68044] \textit{Buhrman, Harry; Torenvliet, Leen}, Randomness is hard, 249-260 [Zbl 0935.68052] \textit{Lindner, Wolfgang; Schuler, Rainer; Watanabe, Osamu}, Resource bounded measure and learnability, 261-270 [Zbl 0935.68054] \textit{Goldsmith, Judy; Mundhenk, Martin}, Complexity issues in Markov decision processes, 272-280 [Zbl 0935.68045]
0 references