8695 search results - page 188 / 1739 » Making the Complex Simple |
159
click to vote
COCO
1995
Springer
15 years 10 months ago
1995
Springer
The instance complexity of a string x with respect to a set A and time bound t, ict (x : A), is the length of the shortest program for A that runs in time t, decides x correctly, ...
189
click to vote
ISAAC
2007
Springer
16 years 21 days ago
2007
Springer
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
198
click to vote
CORR
2009
Springer
15 years 4 months ago
2009
Springer
The past research on the state complexity of operations on regular languages is examined, and a new approach based on an old method (derivatives of regular expressions) is presente...
234
click to vote
SIGECOM
2011
ACM
14 years 9 months ago
2011
ACM
Recent results in complexity theory suggest that various economic theories require agents to solve computationally intractable problems. However, such results assume the agents ar...
161
click to vote
VIS
2003
IEEE
16 years 7 months ago
2003
IEEE
One of the reasons that topological methods have a limited popularity for the visualization of complex 3D flow fields is the fact that such topological structures contain a number...