Filters








85,588 Hits in 4.2 sec

Complexity classes of equivalence problems revisited

Lance Fortnow, Joshua A. Grochow
2011 Information and Computation  
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality.  ...  relation of cospectrality.  ...  In particular, Stuart suggested the use of the equivalence relation R L , which led us to Theorem 4.3, and Laci pointed out the canonical form for subgroup equality of permutation groups [10] .  ... 
doi:10.1016/j.ic.2011.01.006 fatcat:6j7dn6pkg5bypdzeuoym6webk4

Problem characterization in tracking/fusion algorithm evaluation

Chee-Yee Chong
2001 IEEE Aerospace and Electronic Systems Magazine  
The performance of a tracking/fusion algorithm depends very much on the complexity of the problem.  ...  Evaluation is performed by characterizing the performance of the basic functions of prediction and association. The problem complexity is summarized by means of context metrics.  ...  Another example of equivalence classes is the normalized target dynamics for prediction accuracy. The problem parameters that affect prediction accuracy are target dynamics and sensor revisit rate.  ... 
doi:10.1109/62.935460 fatcat:3qvpe3u3ifavjesyfjjxb2q2si

Problem characterization in tracking/fusion algorithm evaluation

Chee-Yee Chong
2000 Proceedings of the Third International Conference on Information Fusion  
The performance of a tracking/fusion algorithm depends very much on the complexity of the problem.  ...  Evaluation is performed by characterizing the performance of the basic functions of prediction and association. The problem complexity is summarized by means of context metrics.  ...  Another example of equivalence classes is the normalized target dynamics for prediction accuracy. The problem parameters that affect prediction accuracy are target dynamics and sensor revisit rate.  ... 
doi:10.1109/ific.2000.862453 fatcat:2qvxkcumjfcclp4b4r52xaeevm

Beyond No Free Lunch: Realistic Algorithms for Arbitrary Problem Classes [article]

James A. R. Marshall, Thomas G. Hinton
2010 arXiv   pre-print
Then we provide a more refined definition of performance under which we show that revisiting algorithms are always trumped by enumerative ones.  ...  We show how the necessary and sufficient conditions for the NFL to apply can be reduced to the single requirement of the set of objective functions under consideration being closed under permutation, and  ...  Proof: Searching under a c.u.p. set of objective functions F with an algorithm A which revisits some points x i ∈ X is equivalent to a non-revisiting search of a new set of extended objective functions  ... 
arXiv:0907.1597v3 fatcat:kb4z7paen5ekva3qwj3z3a4gue

Beyond No Free Lunch: Realistic algorithms for arbitrary problem classes

James A. R. Marshall, Thomas G. Hinton
2010 IEEE Congress on Evolutionary Computation  
We begin by unifying the assumptions of closure under permutation and non-revisiting algorithms.  ...  As a consequence of a proof that non-revisiting enumeration has the best possible expected performance for arbitrary distributions over arbitrary problem sets, this allows us to show that better than enumeration  ...  Proof: Searching under a c.u.p. set of objective functions F with an algorithm A which revisits some points x i ∈ X is equivalent to a non-revisiting search of a new set of extended objective functions  ... 
doi:10.1109/cec.2010.5586389 dblp:conf/cec/MarshallH10 fatcat:nono6xay2bh6lpo7fix2puzihm

Volume TOC

2002 Journal of computer and system sciences (Print)  
Ramesh545The consensus string problem and the complexity of comparing hidden Markov models Rune B. Lyngs and Christian N.S.  ...  Wanke 377 The Equivalence Problem for DF0L Languages and Power Series Juha Honkala 393 Unary Context-Free Grammars and Pushdown Automata, Descriptional Complexity and Auxiliary Space Lower Bounds  ... 
doi:10.1016/s0022-0000(02)00053-3 fatcat:47pyacdjpbhx7pzsx2iasdeyom

Preface

V. Koubek, J. Kratochvíl
2005 Theoretical Computer Science  
of context-free grammars of arbitrarily low ambiguity, "A hierarchy of shift equivalent sofic shifts" by Béal, Fiorenzi and Perrin defining a new infinity hierarchy on subclasses of the class of irreducible  ...  Kolmogorov complexity is explored in "Resource bounded symmetry of information revisited" by Lee and Romashchenko which present worlds where symmetry of information between Kolmogorov complexity and conditional  ...  some classes of polynomial complexity and non-existence of reducibilities between some classes of exponential complexity.  ... 
doi:10.1016/j.tcs.2005.07.005 fatcat:kgzeybxxybf25brnmx6udotmqm

Syntactic control of interference revisited

1995 Theoretical Computer Science  
Syntactic control of interference revisited http://www,elsevier.nl/locate/entcs/volumel/tennent In "Syntactic Control of Interference" (POPL, 1978), J. C.  ...  We then define a class of "bireflective" models, which are shown to provide a sound interpretation of the type system; a companion paper, "Bireflectivity," in this volume provides a categorical analysis  ...  We show that this theory simultaneously provides a topological foundation for the complexity analysis of programs via the new theory of "complexity (distance) spaces". The complexity spaces are shown  ... 
doi:10.1016/0304-3975(96)80138-1 fatcat:k3rggrbb5zfflbka3rpi243s3a

Enhanced forma analysis of permutation problems

Tao Gong, Andrew L. Tuson
2007 Proceedings of the 9th annual conference on Genetic and evolutionary computation - GECCO '07  
interpretation of declarative constraints and the complexity of the application of operator.  ...  In the case of permutation problems, where the basis is highly constrained, the declarative nature of forma analysis encounters some difficulties which give rise to some additional issues, such as the  ...  The initial aim of forma analysis [7] was to codify knowledge of the problem domain using a set of equivalence classes (or formae) which is assumed to be able to cluster solutions with related performance  ... 
doi:10.1145/1276958.1277146 dblp:conf/gecco/GongT07a fatcat:6rf3jyabibcv3lzqcfo3u5cq6i

Edge-Graph Diameter Bounds for Convex Polytopes with Few Facets

David Bremner, Lars Schewe
2011 Experimental Mathematics  
We show this result by showing this bound for a more general structure -- so-called matroid polytopes -- by reduction to a small number of satisfiability problems.  ...  We show that the edge graph of a 6-dimensional polytope with 12 facets has diameter at most 6, thus verifying the d-step conjecture of Klee and Walkup in the case of d=6.  ...  It would be potentially useful to give criteria that further reduce the number of equivalence classes of path complexes to be considered.  ... 
doi:10.1080/10586458.2011.564965 fatcat:4wk2f4b6unck7i5ynsp3pfvuji

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

2004 Mathematical Reviews  
Summary: “We begin with a brief tutorial on the problem of learn- ing a finite concept class over a finite domain using membership queries and/or equivalence queries.  ...  Kolmogorov complexity theory is used as a tool. “Classes of strings ‘typical’ for a given probability measure are introduced.  ... 

Complexity of Decision Problems for Simple Regular Expressions [chapter]

Wim Martens, Frank Neven, Thomas Schwentick
2004 Lecture Notes in Computer Science  
We study the complexity of the inclusion, equivalence, and intersection problem for simple regular expressions arising in practical XML schemas.  ...  For equivalence, we only prove an initial tractability result leaving the complexity of more general cases open.  ...  In the present paper, we revisit the complexity of the inclusion, equivalence, and intersection problem for XML schemas occurring effectively in practice.  ... 
doi:10.1007/978-3-540-28629-5_70 fatcat:naebcdd6sbe4hfe4iahcxwrccy

Revisiting Cook-Levin theorem using NP-Completeness and Circuit-SAT

Edward E. Ogheneovo
2020 International Journal of Advanced Engineering Research and Science  
In this paper, we revisit Cook-Levin Theorem but using a completely different approach to prove the theorem. The approach used combines the concepts of NP-completeness and circuit-SAT.  ...  Thus Cook-Levin theorem provides a proof that the problem of SAT is NP-complete via reduction technique.  ...  The important thing about NP complexity class is that problems within that class can be verified by a polynomial time algorithm.  ... 
doi:10.22161/ijaers.73.34 fatcat:65w3u3o5xnc7dawl2rjeeq7v4u

Page 3850 of Mathematical Reviews Vol. , Issue 98F [page]

1998 Mathematical Reviews  
Lutz, Equivalence of measures of complexity classes (535-545); Vincenzo Auletta and Mimmo Parente, Better algorithms for minimum weight vertex- connectivity problems (547-558); Hans Jiirgen Prémel and  ...  Shallit, The compu- tational complexity of some problems of linear algebra (extended abstract) (451-462); Thomas Schwentick, Algebraic and logical characterizations of deterministic linear time classes  ... 

Book reports

Ervin Y. Rodin
2005 Computers and Mathematics with Applications  
The Editors decided to break with the longstanding custom of publishing either lengthy and discursive reviews of a few books, or just a brief listing of titles.  ...  Hence, breaking with custom, we also publish a complete table of contents for each such book, but no review of it as such.  ...  Index of used MAPLE Commands. Index of used MATLAB Commands. Contents Introduction Zero Equivalence. 2.1. Zero-Equivalence of Constants. 2.1.1. l~ichardson's Uniformity Conjectures. 2.2.  ... 
doi:10.1016/j.camwa.2005.01.013 fatcat:7psoarysizguli5jnt6gf3q2s4
« Previous Showing results 1 — 15 out of 85,588 results