Suche
Kategorie
JGU Mainz (85460)
Uni Trier (15102)
15102 Treffer
×
Universität Trier
- Damm, Carsten
- On Boolean vs. modular arithmetic for circuits and communication protocols
- Trier: Univ. 1998 7 S. (Trierer Forschungsberichte ; 98-06)
- Damm, C.; Jukna, S.; Sgall, J.
- Some Bounds on Multiparty Communication Complexity of Pointer Jumping
- Lecture notes in computer science. Bd. 1046. Berlin: Springer 1996 S. 643 - 654
- Jukna, S.
- Finite limits and monotone computations: the lower bounds criterion
- Proceedings 12th Annual Conference on Computational Complexity. IEEE Computer Society 1997 S. 302 - 313
- Jukna, S.; Razborov, A.; Savicky, P. et al.
- On P versus NP(intersection)co-NP for decision trees and read-once branching programs
- Computational complexity. Bd. 8. H. 4. Basel: Birkhäuser 1999 S. 357 - 370
- Jukna, S.; Beame, P.; Buss, S.
- Exponential Lower bounds for semantic resolution
- Beame, P.; Buss, S. (Hrsg). Feasible Arithmetics and Length of Proofs. American Mathematical Society 1998 S. 63 - 172
- Jukna, S.; Razborov, A.
- Neither reading few bits twice nor reading illegally helps much
- Discrete Applied Mathematics. Bd. Discrete Applied Mathematics. 1998 S. 223 - 238
- Jukna, S.; Zák, S.
- Complexity: - On Branching Programs With Bounded Uncertainty
- Lecture notes in computer science. Bd. 1443. Berlin: Springer 1998 S. 259 - 270
- Goldsmith, J.; Littman, M.; Mundhenk, M.
- The complexity of plan existence and evaluation in probabilistic domains
- Proc. 13th Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann Publishers 1997 S. 182 - 189
- Mundhenk, M.; Goldsmith, J.; Allender, E.
- The Complexity of Policy Evaluation for Finite-Horizon Partially- Observable Markov Decision Processes
- Lecture notes in computer science. Bd. 1295. Berlin: Springer 1997 S. 129 - 138
- Mundhenk, M.
- NP-hard Sets Have Many Hard Instances
- Lecture notes in computer science. Bd. 1295. Berlin: Springer 1997 S. 428 - 437