History
1
any:"hard"
19888


Please fill in your query. A complete syntax description you will find on the General Help page.
first | previous | 18261 18281 18301 18321 18341 18361 18381 18401 18421 18441 18461 | next | last

Result 18361 to 18380 of 19888 total

Shortest paths without a map. (English)
Theor. Comput. Sci. 84, No.1, 127-150 (1991).
WorldCat.org
18361
PDF XML AMS-TeX TEXT BIBTeX DOI
A deterministic algorithm for modular knapsack problems. (English)
Theor. Comput. Sci. 88, No.1, 127-138 (1991).
WorldCat.org
18362
PDF XML AMS-TeX TEXT BIBTeX DOI
PP is as hard as the polynomial-time hierarchy. (English)
SIAM J. Comput. 20, No.5, 865-877 (1991).
Reviewer: C.Meinel (Berlin)
WorldCat.org
18363
PDF XML AMS-TeX TEXT BIBTeX DOI
A note on enumerative counting. (English)
Inf. Process. Lett. 38, No.4, 215-219 (1991).
WorldCat.org
18364
PDF XML AMS-TeX TEXT BIBTeX DOI
Simple sentences that are hard to decide. (English)
Inf. Comput. 94, No.1, 62-82 (1991).
WorldCat.org
18365
PDF XML AMS-TeX TEXT BIBTeX DOI
Locating a median subtree on a network. (English)
INFOR 29, No.2, 153-166 (1991).
WorldCat.org
18366
PDF XML AMS-TeX TEXT BIBTeX
Problem of optimizing the number of block accesses in performing relational join is NP-hard. (English)
Inf. Process. Lett. 38, No.5, 271-275 (1991).
WorldCat.org
18367
PDF XML AMS-TeX TEXT BIBTeX DOI
Space-time isomorphism problem is intractable (NP-hard). (English)
Int. J. Theor. Phys. 30, No.9, 1249-1257 (1991).
WorldCat.org
18368
PDF XML AMS-TeX TEXT BIBTeX DOI
A cubic algorithm for the directed Eulerian subgraph problem. (English)
Eur. J. Oper. Res. 50, No.3, 345-352 (1991).
Reviewer: G.Merkel (Leipzig)
WorldCat.org
18369
PDF XML AMS-TeX TEXT BIBTeX DOI
A two-dimensional genetic algorithm for the Ising problem. (English)
Complex Syst. 5, No.3, 327-333 (1991).
WorldCat.org
18370
PDF XML AMS-TeX TEXT BIBTeX
Limitedness theorem on finite automata with distance functions: An algebraic proof. (English)
Theor. Comput. Sci. 81, No.1, 137-145 (1991).
WorldCat.org
18371
PDF XML AMS-TeX TEXT BIBTeX DOI
Planar graph coloring is not self-reducible, assuming P$\ne NP$. (English)
Theor. Comput. Sci. 88, No.1, 183-189 (1991).
WorldCat.org
18372
PDF XML AMS-TeX TEXT BIBTeX DOI
Global and local views of state fairness. (English)
Theor. Comput. Sci. 80, No.1, 77-104 (1991).
WorldCat.org
18373
PDF XML AMS-TeX TEXT BIBTeX DOI
Size-depth trade-offs for monotone arithmetic circuits. (English)
Theor. Comput. Sci. 82, No.1, 85-93 (1991).
WorldCat.org
18374
PDF XML AMS-TeX TEXT BIBTeX DOI
On the word problem in periodic group varieties. (English)
Int. J. Algebra Comput. 1, No.1, 115-126 (1991).
WorldCat.org
18375
PDF XML AMS-TeX TEXT BIBTeX DOI
On area-efficient drawings of rectangular duals for VLSI floor-plan. (English)
Math. Program., Ser. B 52, No.1, 29-43 (1991).
WorldCat.org
18376
PDF XML AMS-TeX TEXT BIBTeX DOI
New results on server problems. (English)
SIAM J. Discrete Math. 4, No.2, 172-181 (1991).
WorldCat.org
18377
PDF XML AMS-TeX TEXT BIBTeX DOI
Unbalanced, capacitated p-median problems on a chain graph with a continuum of link demands. (English)
Networks 21, No.2, 133-163 (1991).
WorldCat.org
18378
PDF XML AMS-TeX TEXT BIBTeX DOI
Optimizing an integrated inventory system under deterministic demand. (English)
Int. J. Syst. Sci. 22, No.4, 769-774 (1991).
WorldCat.org
18379
PDF XML AMS-TeX TEXT BIBTeX DOI
Numerical approximation of the solution of a variational problem with a double well potential. (English)
SIAM J. Numer. Anal. 28, No.2, 321-332 (1991).
WorldCat.org
18380
PDF XML AMS-TeX TEXT BIBTeX DOI
first | previous | 18261 18281 18301 18321 18341 18361 18381 18401 18421 18441 18461 | next | last

Result 18361 to 18380 of 19888 total

Valid XHTML 1.0 Transitional Valid CSS!