... several times to define the notion of |
complexity
Correlations entre complexification et instabilite dans une formalisation du concept de complexite Correlations entre complexification et instabilite dans une formalisation du concept de complexite Collot, F. |
. ... |
... which the scan operation has linear time |
complexity
Linear-time snapshot implementations in unbalanced systems Linear-time snapshot implementations in unbalanced systems Israeli, A.; Shaham, A.; Shirazi, A. |
and the time ... |
... of the actual input. Therefore, in |
complexity
Malign distributions for average case circuit complexity Malign distributions for average case circuit complexity Jakoby, Andreas; Reischuk, Rüdiger; Schindelhauer, Christian |
theory only worst case ... |
... in characterizing the queries in a given |
complexity
Finite Automata and Logic: A Microcosm of Finite Model Theory Finite Automata and Logic: A Microcosm of Finite Model Theory Ebbinghaus, Heinz-Dieter; Flum, Jörg |
class by means of a logic in which they ... |
... of n arguments have “an almost identical” |
complexity
On Networks Consisting of Functional Elements with Delays On Networks Consisting of Functional Elements with Delays Lupanov, O. B. |
which is asymptotically equal to the ... |
... The |
complexity
Effective systolic algorithms for gossiping in cycles and two-dimensional grids Effective systolic algorithms for gossiping in cycles and two-dimensional grids Hromkovič, Juraj; Klasing, Ralf; Pardubská, Dana; Unger, Walter; Waczulik, Juraj; Wagener, Hubert |
of systolic dissemination of information ... |
... First, what is the cost of the introduced |
complexity
The Manufacturer’s Point of View The Manufacturer’s Point of View Hermanrud, B. |
? Second, what are the goals of automated ... |
... collection of formulas. We then study the |
complexity
Complexity of computing with extended propositional logic programs Complexity of computing with extended propositional logic programs Wiktor Marek, V.; Rajasekar, Arcot; Truszczyński, Mirosław |
of computing withF-programs.F-programs can ... |
... inputs as a parameter and study how the |
complexity
Parameterized Computational Feasibility Parameterized Computational Feasibility Downey, Rodney G.; Fellows, Michael R. |
of the problem varies if the parameter is ... |
... This paper addresses |
complexity
On the computational cost of disjunctive logic programming: Propositional case On the computational cost of disjunctive logic programming: Propositional case Eiter, Thomas; Gottlob, Georg |
issues for important problems arising with ... |
... figure that characteristically has great |
complexity
Mid-Atlantic salt-marsh shorelines: Mathematical commonalities Mid-Atlantic salt-marsh shorelines: Mathematical commonalities Simon, Richard M.; Simon, Richard H. |
in its boundaries. ... |
... objects is expensive in terms of algorithm |
complexity
Real-time Collision Checking for 3D Object Positioning in Sparse Environments Real-time Collision Checking for 3D Object Positioning in Sparse Environments Jaume, Jaume; Galli, Ricardo; Mas, Ramon; Mascaró-Oliver, Miquel |
and CPU use and some constraints should be ... |
... individual ideas influence the integrative |
complexity
Developing complex group products: Idea combination in computer-mediated and face-to-face groups Developing complex group products: Idea combination in computer-mediated and face-to-face groups Cummings, Anne; Schlosser, Ann; Arrow, Holly |
of group products. ... |
... the general case. This paper considers two |
complexity
Measuring the distance to series-parallelity by path expressions Measuring the distance to series-parallelity by path expressions Naumann, Valeska |
measures of two-terminal directed acyclic ... |
... a new approach to the study of “intrinsic” |
complexity
The structure of intrinsic complexity of learning The structure of intrinsic complexity of learning Jain, Sanjay; Sharma, Arun |
of learning has originated in the work of ... |
... the distribution and nonuniform |
complexity
Completeness and weak completeness under polynomial-size circuits Completeness and weak completeness under polynomial-size circuits Juedes, David W.; Lutz, Jack H. |
of problems that are complete or weakly ... |
... a very smooth translation from worst case |
complexity
Structure in average case complexity Structure in average case complexity Karg, Christoph; Schuler, Rainer |
to average case ... |
... notoriously hard to express computational |
complexity
Expressing computational complexity in constructive type theory Expressing computational complexity in constructive type theory Constable, Robert L. |
properties of programs in programming ... |
... A new software structural |
complexity
S/C: a Software Size/Complexity Measure S/C: a Software Size/Complexity Measure Pant, Y. R.; Verner, J. M.; Henderson-Sellers, B. |
metric is proposed which is a simple, yet ... |
... the (function value query) learning |
complexity
Learning sparse linear combinations of basis functions over a finite domain Learning sparse linear combinations of basis functions over a finite domain Nakamura, Atsuyoshi; Miura, Shinji |
of subclasses of such functions, namely, ... |
... the probability of errors increases with |
complexity
A set of complexity metrics for guiding the software test process A set of complexity metrics for guiding the software test process Liggesmeyer, Peter |
. ... |
... ofn input-sets, if their PI k -set |
complexity
PIk mass production and an optimal circuit for the Nečiporuk slice PIk mass production and an optimal circuit for the Nečiporuk slice Hiltgen, Alain P.; Paterson, Mike S. |
satisfiesSC m (FX)≥3n+2m. ... |
... mechanisms to measure the inherent |
complexity
Complexity Measures for System Development Models Complexity Measures for System Development Models Ferneley, E. H.; Howcroft, D. A.; Davies, C. G. |
of the formative stages of the software ... |
... This is a short note on thespatiotemporal |
complexity
Spatiotemporal complexity of the universe at subhorizon scales Spatiotemporal complexity of the universe at subhorizon scales Rosu, H. |
of the dynamical state(s) of the Universe ... |
... We prove the Instance |
Complexity
Resource-bounded instance complexity Resource-bounded instance complexity Fortnow, Lance; Kummer, Martin |
Conjecture of Ko, Orponen, Schöning, and ... |