Chung, Fan R. K.; Garey, Michael R.; Tarjan, Robert E. Strongly connected orientations of mixed multigraphs. (English) Zbl 0645.90097 Networks 15, No. 4, 477-484 (1985). MSC: 90C35 68Q25 PDFBibTeX XMLCite \textit{F. R. K. Chung} et al., Networks 15, 477--484 (1985; Zbl 0645.90097) Full Text: DOI
Nurminskij, E. A.; Andrusenko, S. K.; Stetsyuk, R. I. On a new polynomial algorithm of linear programming. (Russian) Zbl 0625.90051 Kibernetika 1985, No. 4, 118-120 (1985). Reviewer: C.Zălinescu MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{E. A. Nurminskij} et al., Kibernetika 1985, No. 4, 118--120 (1985; Zbl 0625.90051)
Wang, Jie; Hou, Guangkun; Li, Xiang On relativized complexity classes. (Chinese. English summary) Zbl 0623.68049 Acta Sci. Nat. Univ. Sunyatseni 1985, No. 2, 104-105 (1985). MSC: 68Q25 03D15 PDFBibTeX XMLCite \textit{J. Wang} et al., Acta Sci. Nat. Univ. Sunyatseni 1985, No. 2, 104--105 (1985; Zbl 0623.68049)
Atkinson, M. D. Partial orders and comparison problems. (English) Zbl 0623.06002 Combinatorics, graph theory and computing, Proc. 16th Southeast. Conf., Boca Raton/Fl. 1985, Congr. Numerantium 47, 77-88 (1985). MSC: 06A06 68W99 05A05 05A15 06A05 PDFBibTeX XML
Chazelle, Bernard; Dobkin, David P. Optimal convex decompositions. (English) Zbl 0609.68035 Computational geometry, Mach. Intell. Pattern Recognition 2, 63-133 (1985). Reviewer: T.Ocneanu MSC: 68Q25 51M20 PDFBibTeX XML
Ko, Ker-I Continuous optimization problems and a polynomial hierarchy of real functions. (English) Zbl 0609.03015 J. Complexity 1, 210-231 (1985). MSC: 03D15 03F60 03D60 68Q25 PDFBibTeX XMLCite \textit{K.-I Ko}, J. Complexity 1, 210--231 (1985; Zbl 0609.03015) Full Text: DOI
Balcázar, Jose L.; Book, Ronald V.; Schöning, Uwe On bounded query machines. (English) Zbl 0608.68038 Theor. Comput. Sci. 40, 237-243 (1985). MSC: 68Q25 68Q05 PDFBibTeX XMLCite \textit{J. L. Balcázar} et al., Theor. Comput. Sci. 40, 237--243 (1985; Zbl 0608.68038) Full Text: DOI
Strusevich, V. A. The three-machine problem: Sufficient reducibility condition in convex form. (Russian) Zbl 0606.90063 Vestn. Beloruss. Gos. Univ. Im. V. I. Lenina, Ser. I 1985, No. 1, 36-39 (1985). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{V. A. Strusevich}, Vestn. Beloruss. Gos. Univ. Im. V. I. Lenina, Ser. I 1985, No. 1, 36--39 (1985; Zbl 0606.90063)
Kolen, Antoon The round-trip p-center and covering problem on a tree. (English) Zbl 0606.90041 Transp. Sci. 19, 222-234 (1985). MSC: 90B05 90C27 68Q25 05C05 PDFBibTeX XMLCite \textit{A. Kolen}, Transp. Sci. 19, 222--234 (1985; Zbl 0606.90041) Full Text: DOI
Kanovich, M. I. Efficient logical algorithms of analysis and the synthesis of dependencies. (English. Russian original) Zbl 0606.68040 Sov. Math., Dokl. 32, 867-871 (1985); translation from Dokl. Akad. Nauk SSSR 285, 1301-1305 (1985). Reviewer: E.Knuth MSC: 68Q25 68P20 68Q60 PDFBibTeX XMLCite \textit{M. I. Kanovich}, Sov. Math., Dokl. 32, 867--871 (1985; Zbl 0606.68040); translation from Dokl. Akad. Nauk SSSR 285, 1301--1305 (1985)
Kaltofen, Erich Polynomial-time reductions from multivariate to bi- and univariate integral polynomial factorization. (English) Zbl 0605.12001 SIAM J. Comput. 14, 469-489 (1985). MSC: 11R09 68W30 11Y16 12-08 12D05 11T06 PDFBibTeX XMLCite \textit{E. Kaltofen}, SIAM J. Comput. 14, 469--489 (1985; Zbl 0605.12001) Full Text: DOI Link
Frigessi, A.; Vercellis, C. An analysis of Monte Carlo algorithms for counting problems. (English) Zbl 0604.68048 Calcolo 22, 413-428 (1985). MSC: 68Q25 PDFBibTeX XMLCite \textit{A. Frigessi} and \textit{C. Vercellis}, Calcolo 22, 413--428 (1985; Zbl 0604.68048) Full Text: DOI
Leung, Joseph Y.-T.; Monien, Burkhard On the complexity of deadlock recovery. (English) Zbl 0604.68045 Theoretical aspects of computer science, 2nd ann. Symp., Saarbrücken/Ger. 1985, Lect. Notes Comput. Sci. 182, 208-218 (1985). MSC: 68Q25 68N25 PDFBibTeX XML
von zur Gathen, Joachim Irreducibility of multivariate polynomials. (English) Zbl 0604.68043 J. Comput. Syst. Sci. 31, 225-264 (1985). MSC: 68W30 12E05 68Q25 PDFBibTeX XMLCite \textit{J. von zur Gathen}, J. Comput. Syst. Sci. 31, 225--264 (1985; Zbl 0604.68043) Full Text: DOI
Kantor, William M. Polynomial-time algorithms for finding elements of prime order and Sylow subgroups. (English) Zbl 0604.20001 J. Algorithms 6, 478-514 (1985). Reviewer: G.Butler MSC: 20-04 68Q25 20B35 20D20 20F05 20D06 PDFBibTeX XMLCite \textit{W. M. Kantor}, J. Algorithms 6, 478--514 (1985; Zbl 0604.20001) Full Text: DOI
Beletskij, S. A.; Levental’, V. Ts. An effective approximate algorithm for a general problem of scheduling theory. (Russian) Zbl 0603.90072 Izv. Akad. Nauk Kaz. SSR, Ser. Fiz.-Mat. 1985, No. 3(124), 16-19 (1985). Reviewer: J.Blazewicz MSC: 90B35 65K05 68Q25 PDFBibTeX XMLCite \textit{S. A. Beletskij} and \textit{V. Ts. Levental'}, Izv. Akad. Nauk Kaz. SSR, Ser. Fiz.-Mat. 1985, No. 3(124), 16--19 (1985; Zbl 0603.90072)
Kannan, R. Solving systems of linear equations over polynomials. (English) Zbl 0603.65024 Theor. Comput. Sci. 39, 69-88 (1985). Reviewer: I.Imam MSC: 65F30 15A54 PDFBibTeX XMLCite \textit{R. Kannan}, Theor. Comput. Sci. 39, 69--88 (1985; Zbl 0603.65024) Full Text: DOI
Gonczarowski, J.; Shamir, E. Pattern selector grammars and several parsing algorithms in the context- free style. (English) Zbl 0601.68057 J. Comput. Syst. Sci. 30, 249-273 (1985). MSC: 68N20 68Q25 PDFBibTeX XMLCite \textit{J. Gonczarowski} and \textit{E. Shamir}, J. Comput. Syst. Sci. 30, 249--273 (1985; Zbl 0601.68057) Full Text: DOI
Rosenkrantz, D. J.; Hunt, H. B. III Testing for grammatical coverings. (English) Zbl 0599.68056 Theor. Comput. Sci. 38, 323-341 (1985). Reviewer: G.Păun MSC: 68Q45 68Q25 PDFBibTeX XMLCite \textit{D. J. Rosenkrantz} and \textit{H. B. Hunt III}, Theor. Comput. Sci. 38, 323--341 (1985; Zbl 0599.68056) Full Text: DOI
Kaltofen, Erich Fast parallel absolute irreducibility testing. (English) Zbl 0599.68038 J. Symb. Comput. 1, 57-67 (1985). MSC: 68W30 68Q25 12E05 12D05 PDFBibTeX XMLCite \textit{E. Kaltofen}, J. Symb. Comput. 1, 57--67 (1985; Zbl 0599.68038) Full Text: DOI
von zur Gathen, Joachim; Kaltofen, Erich Factoring sparse multivariate polynomials. (English) Zbl 0599.68037 J. Comput. Syst. Sci. 31, 265-287 (1985). MSC: 68W30 12E05 68Q25 PDFBibTeX XMLCite \textit{J. von zur Gathen} and \textit{E. Kaltofen}, J. Comput. Syst. Sci. 31, 265--287 (1985; Zbl 0599.68037) Full Text: DOI
Hopcroft, John; Joseph, Deborah; Whitesides, Sue On the movement of robot arms in 2-dimensional bounded regions. (English) Zbl 0597.68040 SIAM J. Comput. 14, 315-333 (1985). Reviewer: L.Dorst MSC: 68Q25 70B15 68U99 PDFBibTeX XMLCite \textit{J. Hopcroft} et al., SIAM J. Comput. 14, 315--333 (1985; Zbl 0597.68040) Full Text: DOI
Brandstädt, Andreas Partitions of graphs into one or two independent sets and cliques. (English) Zbl 0597.68039 Graphs, hypergraphs and applications, Proc. Conf. Graph Theory, Eyba/GDR 1984, Teubner-Texte Math. 73, 19-22 (1985). MSC: 68Q25 05C70 PDFBibTeX XML
Schnorr, C. P.; Alexi, W. RSA-bits are \(0.5+\varepsilon\) secure. (English) Zbl 0596.94011 Advances in cryptology, Proc. EUROCRYPT 84, Workshop Paris 1984, Lect. Notes Comput. Sci. 209, 113-126 (1985). MSC: 94A60 68Q25 PDFBibTeX XML Full Text: DOI
Kaltofen, Erich; Rolletschek, Heinrich Arithmetic in quadratic fields with unique factorization. (English) Zbl 0596.12001 Computer algebra, EUROCAL ’85, Proc. Eur. Conf., Linz/Austria 1985, Vol. 2, Lect. Notes Comput. Sci. 204, 279-288 (1985). Reviewer: F.J.van der Linden MSC: 12-04 11R11 11R04 11R27 11A05 68Q25 PDFBibTeX XML
Gavril, Fanica; Schönheim, Johanan Constructing trees with prescribed cardinalities for the components of their vertex deleted subgraphs. (English) Zbl 0593.68048 J. Algorithms 6, 239-252 (1985). MSC: 68R10 05C05 PDFBibTeX XMLCite \textit{F. Gavril} and \textit{J. Schönheim}, J. Algorithms 6, 239--252 (1985; Zbl 0593.68048) Full Text: DOI
Stockmeyer, Larry On approximation algorithms for #P. (English) Zbl 0589.68031 SIAM J. Comput. 14, 849-861 (1985). Reviewer: A.V.Anisimov MSC: 68Q25 PDFBibTeX XMLCite \textit{L. Stockmeyer}, SIAM J. Comput. 14, 849--861 (1985; Zbl 0589.68031) Full Text: DOI
Gottlob, G.; Leitsch, A. Fast subsumption algorithms. (English) Zbl 0588.68044 Computer algebra, EUROCAL ’85, Proc. Eur. Conf., Linz/Austria 1985, Vol. 2, Lect. Notes Comput. Sci. 204, 64-77 (1985). Reviewer: J.Šajda MSC: 68T15 68Q25 PDFBibTeX XML
Lautemann, Clemens; Meyer auf der Heide, Friedhelm Lower time bounds for integer programming with two variables. (English) Zbl 0587.90072 Inf. Process. Lett. 21, 101-105 (1985). Reviewer: H.Suzuki MSC: 90C10 68Q25 PDFBibTeX XMLCite \textit{C. Lautemann} and \textit{F. Meyer auf der Heide}, Inf. Process. Lett. 21, 101--105 (1985; Zbl 0587.90072) Full Text: DOI
Richter, K. The robot sequencing problem: Polynomial algorithm and complexity. (English) Zbl 0586.90052 Optimization 16, 597-605 (1985). Reviewer: J.Blazewicz MSC: 90B35 68Q25 05C35 PDFBibTeX XMLCite \textit{K. Richter}, Optimization 16, 597--605 (1985; Zbl 0586.90052) Full Text: DOI
Nickels, W.; Rödder, W.; Xu, L.; Zimmermann, H.-J. Intelligent gradient search in linear programming. (English) Zbl 0585.90056 Eur. J. Oper. Res. 22, 293-303 (1985). Reviewer: J.Mandel MSC: 90C05 65K05 68Q25 PDFBibTeX XMLCite \textit{W. Nickels} et al., Eur. J. Oper. Res. 22, 293--303 (1985; Zbl 0585.90056) Full Text: DOI
Iliopoulos, Costas S. Computing in general Abelian groups is hard. (English) Zbl 0585.68053 Theor. Comput. Sci. 41, 81-93 (1985). MSC: 68Q25 20F05 20K01 68W30 11A41 11-04 PDFBibTeX XMLCite \textit{C. S. Iliopoulos}, Theor. Comput. Sci. 41, 81--93 (1985; Zbl 0585.68053) Full Text: DOI
Long, Timothy J. On restricting the size of oracles compared with restricting access to oracles. (English) Zbl 0583.68025 SIAM J. Comput. 14, 585-597 (1985). MSC: 68Q25 68Q05 03D15 PDFBibTeX XMLCite \textit{T. J. Long}, SIAM J. Comput. 14, 585--597 (1985; Zbl 0583.68025) Full Text: DOI
Book, Ronald V. The base of the intersection of two free submonoids. (English) Zbl 0583.20046 Discrete Appl. Math. 12, 13-20 (1985). Reviewer: G.Butler MSC: 20M05 20M35 68Q25 05C99 PDFBibTeX XMLCite \textit{R. V. Book}, Discrete Appl. Math. 12, 13--20 (1985; Zbl 0583.20046) Full Text: DOI
Livchak, A. B. On polynomial computability. (English. Russian original) Zbl 0582.68063 Sov. Math. 29, No. 1, 89-91 (1985); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 1985, No. 1, 66-67 (1985). Reviewer: M.Zimand MSC: 68P20 68Q25 03B15 68Q65 68P05 03C13 PDFBibTeX XMLCite \textit{A. B. Livchak}, Sov. Math. 29, No. 1, 89--91 (1985; Zbl 0582.68063); translation from Izv. Vyssh. Uchebn. Zaved., Mat. 1985, No. 1, 66--67 (1985)
Hromkovič, Juraj On the power of alternation in automata theory. (English) Zbl 0582.68018 J. Comput. Syst. Sci. 31, 28-39 (1985). MSC: 68Q05 68Q45 68Q25 PDFBibTeX XMLCite \textit{J. Hromkovič}, J. Comput. Syst. Sci. 31, 28--39 (1985; Zbl 0582.68018) Full Text: DOI
Watanabe, Osamu On one-one polynomial time equivalence relations. (English) Zbl 0582.68016 Theor. Comput. Sci. 38, 157-165 (1985). Reviewer: Renji Tao MSC: 68Q25 03D15 PDFBibTeX XMLCite \textit{O. Watanabe}, Theor. Comput. Sci. 38, 157--165 (1985; Zbl 0582.68016) Full Text: DOI
Roskind, James; Tarjan, Robert E. A note on finding minimum-cost edge-disjoint spanning trees. (English) Zbl 0581.90093 Math. Oper. Res. 10, 701-708 (1985). MSC: 90C35 05C35 68Q25 05C05 PDFBibTeX XMLCite \textit{J. Roskind} and \textit{R. E. Tarjan}, Math. Oper. Res. 10, 701--708 (1985; Zbl 0581.90093) Full Text: DOI
Wechsung, Gerd On the Boolean closure of NP. (English) Zbl 0581.68043 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 485-493 (1985). Reviewer: A.Slisenko MSC: 68Q25 03D15 03D10 68Q05 03D20 PDFBibTeX XML
Vyskoč, Jozef Estimating the permanent. (English) Zbl 0581.68038 Comput. Artif. Intell. 4, 445-449 (1985). MSC: 68W30 68Q25 15A15 PDFBibTeX XMLCite \textit{J. Vyskoč}, Comput. Artif. Intell. 4, 445--449 (1985; Zbl 0581.68038)
Richey, M. B.; Parker, R. Gary; Rardin, R. L. On finding spanning Eulerian subgraphs. (English) Zbl 0579.90094 Nav. Res. Logist. Q. 32, 443-455 (1985). Reviewer: Tian Feng MSC: 90C35 05C35 68Q25 05C45 PDFBibTeX XMLCite \textit{M. B. Richey} et al., Nav. Res. Logist. Q. 32, 443--455 (1985; Zbl 0579.90094) Full Text: DOI
Queyranne, Maurice Bounds for assembly line balancing heuristics. (English) Zbl 0579.90054 Oper. Res. 33, 1353-1359 (1985). MSC: 90B35 68Q25 PDFBibTeX XMLCite \textit{M. Queyranne}, Oper. Res. 33, 1353--1359 (1985; Zbl 0579.90054) Full Text: DOI
Maxwell, William L.; Muckstadt, John A. Establishing consistent and realistic reorder intervals in production- distribution systems. (English) Zbl 0579.90048 Oper. Res. 33, 1316-1341 (1985). MSC: 90B30 90B05 90C90 90C30 65K05 90C10 68Q25 PDFBibTeX XMLCite \textit{W. L. Maxwell} and \textit{J. A. Muckstadt}, Oper. Res. 33, 1316--1341 (1985; Zbl 0579.90048) Full Text: DOI
Hromkovič, Juraj Alternating multicounter machines with constant number of reversals. (English) Zbl 0579.68033 Inf. Process. Lett. 21, 7-9 (1985). MSC: 68Q05 68Q25 68Q45 PDFBibTeX XMLCite \textit{J. Hromkovič}, Inf. Process. Lett. 21, 7--9 (1985; Zbl 0579.68033) Full Text: DOI
Keil, J. Mark Finding Hamiltonian circuits in interval graphs. (English) Zbl 0578.68053 Inf. Process. Lett. 20, 201-206 (1985). MSC: 68R10 05C45 05C38 68Q25 PDFBibTeX XMLCite \textit{J. M. Keil}, Inf. Process. Lett. 20, 201--206 (1985; Zbl 0578.68053) Full Text: DOI
van der Hulst, Marc-Paul; Lenstra, Arjen K. Factorization of polynomials by transcendental evaluation. (English) Zbl 0577.68057 Computer algebra, EUROCAL ’85, Proc. Eur. Conf., Linz/Austria 1985, Vol. 2, Lect. Notes Comput. Sci. 204, 138-145 (1985). MSC: 68W30 68Q25 PDFBibTeX XML
Lenstra, A. K. Factoring multivariate polynomials over finite fields. (English) Zbl 0577.12013 J. Comput. Syst. Sci. 30, 235-248 (1985). Reviewer: Nikolai L. Manev (Sofia) MSC: 11T06 68W30 12D05 65Yxx PDFBibTeX XMLCite \textit{A. K. Lenstra}, J. Comput. Syst. Sci. 30, 235--248 (1985; Zbl 0577.12013) Full Text: DOI Link
Grötschel, Martin; Jünger, Michael; Reinelt, Gerhard On the acyclic subgraph polytope. (English) Zbl 0577.05034 Math. Program. 33, 28-42 (1985). MSC: 05C20 52Bxx 90C10 05C38 PDFBibTeX XMLCite \textit{M. Grötschel} et al., Math. Program. 33, 28--42 (1985; Zbl 0577.05034) Full Text: DOI
Ambos-Spies, Klaus On the relative complexity of subproblems of intractable problems. (English) Zbl 0577.03020 Theoretical aspects of computer science, 2nd ann. Symp., Saarbrücken/Ger. 1985, Lect. Notes Comput. Sci. 182, 1-12 (1985). MSC: 03D15 03D30 03D20 68Q25 PDFBibTeX XML
Shinoda, Shoji; Tsukiyama, Shuji; Shirakawa, Isao; Omura, Koichi On a second shortest k-tuple of edge-disjoint paths. (English) Zbl 0576.68055 Circuit theory and design 85, Proc. Eur. Conf., Prague/Czech. 1985, 29-32 (1985). MSC: 68R10 05C38 68Q25 PDFBibTeX XML
Brandstädt, Andreas; Kratsch, Dieter On the restriction of some NP-complete graph problems to permutation graphs. (English) Zbl 0575.68069 Fundamentals of computation theory, Proc. 5th Int. Conf., Cottbus/Ger. 1985, Lect. Notes Comput. Sci. 199, 53-62 (1985). MSC: 68R10 68Q25 05C99 PDFBibTeX XML
Furst, Merrick; Lipton, Richard; Stockmeyer, Larry Pseudorandom number generation and space complexity. (English) Zbl 0575.68048 Inf. Control 64, 43-51 (1985). MSC: 68Q25 65C10 05C70 68R10 PDFBibTeX XMLCite \textit{M. Furst} et al., Inf. Control 64, 43--51 (1985; Zbl 0575.68048) Full Text: DOI
Schöning, Uwe Robust algorithms: a different approach to oracles. (English) Zbl 0574.68041 Theor. Comput. Sci. 40, 57-66 (1985). MSC: 68Q05 68Q25 68W99 PDFBibTeX XMLCite \textit{U. Schöning}, Theor. Comput. Sci. 40, 57--66 (1985; Zbl 0574.68041) Full Text: DOI
Dyer, M. E.; Foulds, L. R.; Frieze, A. M. Analysis of heuristics for finding a maximum weight planar subgraph. (English) Zbl 0573.90093 Eur. J. Oper. Res. 20, 102-114 (1985). Reviewer: Li Weixuan MSC: 90C35 68Q25 05C35 68R10 65K05 PDFBibTeX XMLCite \textit{M. E. Dyer} et al., Eur. J. Oper. Res. 20, 102--114 (1985; Zbl 0573.90093) Full Text: DOI
Hastings, Harold M. Maps of the interval, polynomial time, and polynomial space. (English) Zbl 0573.68020 SIGACT News 17, No. 2, 44-51 (1985). MSC: 68Q25 PDFBibTeX XML
Arnborg, Stefan Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey. (English) Zbl 0573.68018 BIT 25, 2-23 (1985). Reviewer: J.Błażewicz MSC: 68Q25 68R10 68-02 PDFBibTeX XMLCite \textit{S. Arnborg}, BIT 25, 2--23 (1985; Zbl 0573.68018) Full Text: DOI
Kantor, William M. Sylow’s theorem in polynomial time. (English) Zbl 0573.20022 J. Comput. Syst. Sci. 30, 359-394 (1985). Reviewer: P.P.Pálfy MSC: 20D20 20-04 68Q25 20D05 PDFBibTeX XMLCite \textit{W. M. Kantor}, J. Comput. Syst. Sci. 30, 359--394 (1985; Zbl 0573.20022) Full Text: DOI
Sawik, Tadeusz J. Scheduling lots of dependent unit-time operations on identical machines to minimize schedule length. (English) Zbl 0572.90052 Eur. J. Oper. Res. 19, 331-336 (1985). Reviewer: J.Blazewicz MSC: 90B35 90B30 68Q25 65K05 PDFBibTeX XMLCite \textit{T. J. Sawik}, Eur. J. Oper. Res. 19, 331--336 (1985; Zbl 0572.90052) Full Text: DOI
Matsumoto, Kazuhiko; Nishizeki, Takao; Saito, Nobuji An efficient algorithm for finding multicommodity flows in planar networks. (English) Zbl 0572.90027 SIAM J. Comput. 14, 289-302 (1985). MSC: 90B10 68Q25 65K05 90C35 PDFBibTeX XMLCite \textit{K. Matsumoto} et al., SIAM J. Comput. 14, 289--302 (1985; Zbl 0572.90027) Full Text: DOI
Orponen, Pekka; Russo, David A.; Schöning, Uwe Polynomial levelability and maximal complexity cores. (English) Zbl 0572.68034 Automata, languages and programming, 12th Colloq., Nafplion/Greece 1985, Lect. Notes Comput. Sci. 194, 435-444 (1985). MSC: 68Q25 68Q05 PDFBibTeX XML
Fürer, Martin Deterministic and Las Vegas primality testing algorithms. (English) Zbl 0571.10004 Automata, languages and programming, 12th Colloq., Nafplion/Greece 1985, Lect. Notes Comput. Sci. 194, 199-209 (1985). Reviewer: J.Wolfart MSC: 11A41 68W99 PDFBibTeX XML
Babai, László On Lovász’ lattice reduction and the nearest lattice point problem (shortened version). (English) Zbl 0569.10015 Theoretical aspects of computer science, 2nd ann. Symp., Saarbrücken/Ger. 1985, Lect. Notes Comput. Sci. 182, 13-20 (1985). MSC: 11H06 11H55 68W99 52C07 90C10 PDFBibTeX XML
Helfrich, Bettina An algorithm to construct Minkowski-reduced lattice bases. (English) Zbl 0569.10014 Theoretical aspects of computer science, 2nd ann. Symp., Saarbrücken/Ger. 1985, Lect. Notes Comput. Sci. 182, 173-179 (1985). MSC: 11H06 11H55 68W99 PDFBibTeX XML
Cunningham, William H.; Frank, András A primal-dual algorithm for submodular flows. (English) Zbl 0565.90079 Math. Oper. Res. 10, 251-262 (1985). MSC: 90C35 90B10 68Q25 90C10 PDFBibTeX XMLCite \textit{W. H. Cunningham} and \textit{A. Frank}, Math. Oper. Res. 10, 251--262 (1985; Zbl 0565.90079) Full Text: DOI
Tchuente, Maurice Complexity of the pipeline computation of a family of inner products. (English) Zbl 0564.68034 Math. Soc. Sci. 9, 77-82 (1985). MSC: 68Q25 68R10 PDFBibTeX XMLCite \textit{M. Tchuente}, Math. Soc. Sci. 9, 77--82 (1985; Zbl 0564.68034) Full Text: DOI
Jerrum, Mark R. The complexity of finding minimum-length generator sequences. (English) Zbl 0564.68031 Theor. Comput. Sci. 36, 265-289 (1985). MSC: 68Q25 20B99 PDFBibTeX XMLCite \textit{M. R. Jerrum}, Theor. Comput. Sci. 36, 265--289 (1985; Zbl 0564.68031) Full Text: DOI
Book, Ronald V.; Otto, Friedrich Cancellation rules and extended word problems. (English) Zbl 0561.68030 Inf. Process. Lett. 20, 5-11 (1985). MSC: 68Q65 03D03 94A99 03D40 68Q45 PDFBibTeX XMLCite \textit{R. V. Book} and \textit{F. Otto}, Inf. Process. Lett. 20, 5--11 (1985; Zbl 0561.68030) Full Text: DOI
Rubin, David S. Polynomial algorithms for \(m\times (m+1)\) integer programs and \(m\times (m+k)\) diophantine systems. (English) Zbl 0559.90063 Oper. Res. Lett. 3, 289-291 (1985). MSC: 90C10 68Q25 11D04 PDFBibTeX XMLCite \textit{D. S. Rubin}, Oper. Res. Lett. 3, 289--291 (1985; Zbl 0559.90063) Full Text: DOI
Li, Xiang On relativized nondeterministic polynomial-time bounded computations. (English) Zbl 0558.68041 Int. J. Comput. Math. 17, 151-153 (1985). Reviewer: M.Chytil MSC: 68Q25 68Q05 03D15 68Q45 PDFBibTeX XMLCite \textit{X. Li}, Int. J. Comput. Math. 17, 151--153 (1985; Zbl 0558.68041) Full Text: DOI
Ambos-Spies, Klaus Sublattices of the polynomial time degrees. (English) Zbl 0556.03033 Inf. Control 65, 63-84 (1985). MSC: 03D15 03D20 03D30 68Q25 PDFBibTeX XMLCite \textit{K. Ambos-Spies}, Inf. Control 65, 63--84 (1985; Zbl 0556.03033) Full Text: DOI
Ishii, Hiroaki; Nishida, Toshio The stochastic linear continuous type knapsack problem: A generalized P model. (English) Zbl 0551.90072 Eur. J. Oper. Res. 19, 118-124 (1985). MSC: 90C15 90C08 68Q25 90C10 PDFBibTeX XMLCite \textit{H. Ishii} and \textit{T. Nishida}, Eur. J. Oper. Res. 19, 118--124 (1985; Zbl 0551.90072) Full Text: DOI