• Suche: "computing complexity"

Treffer 21 - 40 von 1.955

21

Зниження обчислювальної складності в задачі нелінійного програмування великої розмірності
Zasyadko, A. A.
The Banking University Bulletin; № 2(23) (2015); 158-162
Вестник Университета банковского дела; № 2(23) (2015); 158-162
Вісник Університету банківської справи; № 2(23) (2015); 158-162

computing complexity, pr... вычислительная сложность... 519.81:621.372 обчислювальна складність...
Fachzeitschrift
Zu den Favoriten
22

The computational complexity of universal hashing
MANSOUR, Y ; NISAN, N ; TIWARI, P
Structure in complexity theoryTheoretical computer science. 107(1):121-133

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
23

Scheduling with monotonous earliness and tardiness penalties
KAHLBACHER, H. G
Project management and schedulingEuropean journal of operational research. 64(2):258-277

Control theory, operatio... Automatique, recherche o... Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
24

PERT and crashing revisited : mathematical generalizations
FOLDES, S ; SOUMIS, F
Project management and schedulingEuropean journal of operational research. 64(2):286-294

Control theory, operatio... Automatique, recherche o... Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
25

Dynamic shortest paths in acyclic networks with Markovian arc costs
PSARAFTIS, H. N ; TSITSIKLIS, J. N
Operations research. 41(1):91-101

Control theory, operatio... Automatique, recherche o... Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
26

An efficient method for inverse dynamics of manipulators based on the virtual work principle
CHANG-DE ZHANG ; SHIN-MIN SONG
Parallel closed-kinematic chain manipulators and devicesJournal of robotic systems. 10(5):605-627

Control theory, operatio... Automatique, recherche o... Mechanical engineering Génie mécanique Sciences exactes et tech... Exact sciences and techn... …
Fachzeitschrift
Zu den Favoriten
27

A very hard log-space counting class
ALVAREZ, C ; JENNER, B
Structure in complexity theoryTheoretical computer science. 107(1):3-30

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
28

nΩ(logn) lower bounds on the size of depth-3 threshold circuits with AND gates at the bottom
RAZBOROV, A ; WIGDERSON, A
Information processing letters. 45(6):303-307

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
29

Theoretical convergence of large-step primal-dual interior point algorithms for linear programming
KOJIMA, M ; MEGIDDO, N ; MIZUNO, S
Mathematical programming. 59(1):1-21

Control theory, operatio... Automatique, recherche o... Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn... …
Fachzeitschrift
Zu den Favoriten
30

The two-dimensional complex LMS algorithm applied to the 2-D DFT
BO LIU ; BRUTON, L. T
IEEE transactions on circuits and systems. 2, Analog and digital signal processing. 40(5):337-341

Electronics Electronique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
31

The traveling salesman problem with distances one and two
PAPADIMITRIOU, C. H ; YANNAKAKIS, M
Mathematics of operations research. 18(1):1-11

Control theory, operatio... Automatique, recherche o... Mathematics Mathématiques Sciences exactes et tech... Exact sciences and techn... …
Fachzeitschrift
Zu den Favoriten
32

The recognition of union trees
LEIZHEN CAI
Information processing letters. 45(6):279-283

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
33

The most vital edges in the minimum spanning tree problem
KAO-CHENG LIN ; MAW-SHENG CHERN
Information processing letters. 45(1):25-31

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
34

The generic oracle hypothesis is false
FOSTER, J. A
Information processing letters. 45(2):59-62

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
35

The four-block model matching problem in l1 and infinite-dimensional linear programming
STAFFANS, O. J
SIAM journal on control and optimization. 31(3):747-779

Control theory, operatio... Automatique, recherche o... Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
36

The controlled rounding problem: complexity and computational experience
KELLY, J. P ; GOLDEN, B. L ; ASSAD, A. A
European journal of operational research. 65(2):207-217

Control theory, operatio... Automatique, recherche o... Sciences exactes et tech... Exact sciences and techn... Sciences et techniques c... Sciences and techniques... …
Fachzeitschrift
Zu den Favoriten
37

The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
CHENG-CHIA CHEN ; I-PENG LIN
Information processing letters. 45(3):131-136

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
38

The computational complexity of pattern formation
MACHTA, J
Journal of statistical physics. 70(3-4):949-966

Theoretical physics Physique théorique Sciences exactes et tech... Exact sciences and techn... Physique Physics …
Fachzeitschrift
Zu den Favoriten
39

The anaphora problem
RISTAD, E. S
Information and computation (Print). 105(1):105-131

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
40

The Edge Hamiltonian Path Problem is NP-complete for bipartite graphs
TEN-HWANG LAI ; SHU-SHANG WEI
Information processing letters. 46(1):21-26

Computer science Informatique Sciences exactes et tech... Exact sciences and techn... Sciences appliquees Applied sciences …
Fachzeitschrift
Zu den Favoriten
Suchwerkzeuge: RSS-Feed abonnieren Diese Suche als E-Mail versenden Suche speichern

Filter