Filters








1,553,766 Hits in 4.0 sec

Complexity Parameters for First-Order Classes [chapter]

Marta Arias, Roni Khardon
2003 Lecture Notes in Computer Science  
We study several complexity parameters for first order formulas and their suitability for first order learning models.  ...  We then identify an alternative notion of size and a simple set of parameters that are useful in this sense.  ...  Complexity parameters for first order logic We introduce different ways of quantifying the representation or description complexity of first order expressions.  ... 
doi:10.1007/978-3-540-39917-9_4 fatcat:r3bnlglvbzhhpowit3u4v6z2ey

Complexity parameters for first order classes

Marta Arias, Roni Khardon
2006 Machine Learning  
We study several complexity parameters for first order formulas and their suitability for first order learning models.  ...  We then identify an alternative notion of size and a simple set of parameters that are useful for first order Horn Expressions.  ...  Characterizing the certificate complexity of first order classes is an interesting direction for future work.  ... 
doi:10.1007/s10994-006-8261-3 fatcat:u5zmuagkhzdf3o4nihdrlitn2e

Parametric ordering of complex systems

P.-M. Binder
1994 Physical review. E, Statistical physics, plasmas, fluids, and related interdisciplinary topics  
For two well-known families of rules, the Wolfram complexity Classes cluster satisfactorily.  ...  Cellular automata (CA) dynamics are ordered in terms of two global parameters, computable a priori from the description of rules.  ...  first or second-order transitions from ordered to disordered dynamics can be observed over the same range of the activity parameter.  ... 
doi:10.1103/physreve.49.2023 pmid:9961442 fatcat:cbeusamyyjgdhjaitx2oijvwga

Structure and Specification as Sources of Complexity

Anuj Dawar, Marc Herbstritt
2009 Foundations of Software Technology and Theoretical Computer Science  
we mean that the ≡ m class of o(G 1 , . . . , G s ) can be computed from the classes of G 1 , . . . , G s ), then, satisfaction of first-order formulas for graphs in C is fixed-parameter tractable.  ...  In the first, we ask how complex can be the set of graphs that satisfy a fixed first-order sentence.  ... 
doi:10.4230/lipics.fsttcs.2009.2336 dblp:conf/fsttcs/Dawar09 fatcat:gubhh5istngmjcauyzu33d3cja

A New Method of Radar Signal Feature Parameter Assessment

Cheng Bolin
2017 Journal Electrical and Electronic Engineering  
This method uses complexity, separability and stability to assess the performance of feature parameters sorting.  ...  Aimed at the problem of radar signal feature parameter assessment in the process of sorting, a multi-index joint assessing method is proposed.  ...  foundation for the optimal parameter selection.  ... 
doi:10.11648/j.jeee.20170502.12 fatcat:mdk2eylhfnhw5m4rjstfk7xnbi

Facilitating software refactoring with appropriate resolution order of bad smells

Hui Liu, Limei Yang, Zhendong Niu, Zhyi Ma, Weizhong Shao
2009 Proceedings of the 7th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering on European software engineering conference and foundations of software engineering symposium - ESEC/FSE '09  
We have a bunch of bad smells, refactoring rules, and refactoring tools, but we do not know which kind of bad smells should be resolved first.  ...  The main contribution of this paper is to motivate the necessity to arrange resolution orders of bad smells, and recommend a resolution order of common bad smells.  ...  The authors thank the anonymous reviewers for their valuable comments and suggestions.  ... 
doi:10.1145/1595696.1595738 dblp:conf/sigsoft/LiuYNMS09 fatcat:au7a7rdwonapbjubh62toz2v3i

Page 2017 of Mathematical Reviews Vol. , Issue 85e [page]

1985 Mathematical Reviews  
The authors give a classification for line complexes of J3. The complexes of the first class can be divided into one-parameter systems of parabolic linear line congruences.  ...  The line complexes of the second class admit a fibration into two- parameter systems of cones (interpreted as line manifolds). H. R.  ... 

Dynamic Complexity Meets Parameterised Algorithms

Jonas Schmidt, Thomas Schwentick, Nils Vortmeier, Thomas Zeume, Ioannis Kokkinis, Michael Wagner
2020 Annual Conference for Computer Science Logic  
Here, "FO" stands for first-order logic, which is equivalent to AC 0 , in the presence of arithmetic [7, 24] .  ...  As our first main contribution, we introduce a uniform framework for small dynamic, parameterised complexity classes (Section 3) based on advice structures (corresponding to additional space) or iterations  ...  A Framework for Parameterised, Dynamic Complexity We first present a uniform point of view on parameterised first-order logic.  ... 
doi:10.4230/lipics.csl.2020.36 dblp:conf/csl/SchmidtSVZK20 fatcat:u3bofincu5euri7b6w6xu5hgti

The Complexity of Satisfaction on Sparse Graphs [chapter]

Anuj Dawar
2010 Lecture Notes in Computer Science  
We are interested in the complexity of the satisfaction relation for first-order logic.  ...  That is, given a graph G and a formula ϕ of first-order logic in the language of graphs: What is the complexity of this, parameterized by the length of ϕ?  ...  Restricted Classes One way to get a handle on the complexity of first-order satisfaction is to consider restricted graph classes.  ... 
doi:10.1007/978-3-642-17493-3_1 fatcat:p2md6mgdnneollnsmsf23tondu

On Moderately Exponential Time for SAT [chapter]

Evgeny Dantsin, Alexander Wolpert
2010 Lecture Notes in Computer Science  
Namely, we extend the class SNP (Strict NP) that consists of Boolean queries defined by existential second-order sentences where the first-order part has a universal prefix.  ...  . ∃ prefix in the first-order part. We prove that if sat can be solved in moderately exponential time then all problems in the extended class can also be solved in moderately exponential time.  ...  Acknowledgment We are grateful to the anonymous referees for their careful analysis and valuable suggestions. We implemented most of the suggestions in the final version.  ... 
doi:10.1007/978-3-642-14186-7_27 fatcat:vwu4po4v7jac7n4ifktf3wqctu

Guest Editorial: Special Issue on Parameterized and Exact Computation, Part I

Venkatesh Raman, Saket Saurabh
2011 Algorithmica  
The papers in this issue form the first part of the two parts special issue in the area of parameterized and exact exponential algorithms and complexity.  ...  The paper 'Well Quasi orders in subclasses of bounded treewidth  ...  While we know that the class of all finite graphs are well quasi ordered under minor order, this paper asserts such a claim (and gives algorithmic applications) for several other orders, in these special  ... 
doi:10.1007/s00453-011-9605-3 fatcat:5bwu4ykmlrcypdm5wzdvtehirq

Page 10257 of Mathematical Reviews Vol. , Issue 2004m [page]

2004 Mathematical Reviews  
We extend the logic of Gire and Hoang with parameter- ized and nested fixed points and first-order combinations of fixed points.  ...  In the present paper, the authors show how to construct, for each standard complexity class K , a parametrized complexity class para-K.  ... 

Parameters of the Fastest Cryptographically Strong Twisted Edwards Curves

Anatoly Bessalov, Vladyslav Dykyi, Anton Malyshko, Oksana Tsygankova, Dariya Yadukha
2019 Theoretical and Applied Cybersecurity  
The complexity of group operations for twisted Edwards curves is estimated. A computation minimization method using curve parameters minimum values selection is proposed.  ...  The tables of system-wide parameters for the 25 fastest crypto-strong twisted Edwards curves with field modulus lengths of 192, 224, 256, 384 and 521 bits are given.  ...  The main properties of these classes of curves [6, 7, 8] : 1) Regarding 2nd-order points, the first class of complete Edwards curves over a prime field is a class of cyclic curves (with an exceptional  ... 
doi:10.20535/tacs.2664-29132019.1.168696 fatcat:qykzljy45zfh7m2bjqxwcibrsa

Packet Scheduling Of Two Classes Flow

Rabie Barhoun, Abdelwahed Namir
2011 International Journal of Computer Science & Information Technology (IJCSIT)  
The first queue for real time flow (class-1) combines the two policies EDF and First in First out (FIFO) to reduce the complexity of EDF.  ...  The second queue for non real time flow (class-2) is scheduled by FIFO policy. The work complexity of our approach is less or equal than O(n log 2 n) with n is the length of the hierarchical queue.  ...  The time complexity of the enqueuing operation for the class-2 is of constant order ܱ(1) since the class-2 is enqueued by FIFO policy.  ... 
doi:10.5121/ijcsit.2011.3410 fatcat:we573s6j7vcundnsoiej4tjju4

On the fixed-parameter tractability of parameterized model-checking problems

Iain A. Stewart
2008 Information Processing Letters  
Abstract In this note, we show, through the use of examples, how generic results for proving fixed-parameter tractability which apply to restricted classes of structures can sometimes be more widely applied  ...  Please consult the full DRO policy for further details. , I. A. (2008) 'On the fixed-parameter tractability of parameterized model-checking problems.  ...  We are indebted to Stefan Szeider for useful comments on an earlier version of this paper, and to two referees for their very useful comments.  ... 
doi:10.1016/j.ipl.2007.09.009 fatcat:xqy3zrciyzadjgv6ppdlx4vkva
« Previous Showing results 1 — 15 out of 1,553,766 results