133,768 Hits in 4.4 sec

Modalities for model checking (extended abstract)

E. Allen Emerson, Chin-Laung Lei
1985 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages - POPL '85  
., al- lowing boolean connectives and nesting) of linear time operators is allowed, the model checking problem is PSPACEcomplete.  ...  Section 4 gives the reduction of the model checking problem for full branching time logic to that for the corresponding linear time logic.  ... 
doi:10.1145/318593.318620 dblp:conf/popl/EmersonL85 fatcat:x6kty74qarhxfhzekz7ey5ypvi

Algorithmic mechanism design (extended abstract)

Noam Nisan, Amir Ronen
1999 Proceedings of the thirty-first annual ACM symposium on Theory of computing - STOC '99  
Following notions from the field of mechanism design, we suggest a framework for studying such algorithms.  ...  We also suggest and motivate extensions to the basic model and prove improved upper bounds in the extended model. Many open problems are suggested as well.  ...  Acknowledgments: We thank Dov Monderer, Motty Perry and Ori Regev for helpful discussions at various stages of this work.  ... 
doi:10.1145/301250.301287 dblp:conf/stoc/NisanR99 fatcat:4khbvbrworgvfjd6li3k3rwi4u

Efficient temporal reasoning (extended abstract)

E. A. Emerson, T. Sadler, J. Srinivasan
1989 Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages - POPL '89  
There has been much interest in decision procedures for testing satisfiability ( or validity) of formulae in various systems of Temporal Logic.  ...  Finally, our results provide insight into the relation between the structural (i.e., syntactic) complexity of temporal logics and the complexity of their decision problems.  ...  as the one used for CTL.  ... 
doi:10.1145/75277.75292 dblp:conf/popl/EmersonSS89 fatcat:lx2gf47mcbhhvht6m2bhor2uoq

Treewidth via Spined Categories (extended abstract) [article]

Zoltan A. Kocsis, Benjamin Merlin Bumpus
2021 arXiv   pre-print
On the practical side, many NP-complete problems are polynomial-time (sometimes even linear-time) solvable on graphs of bounded treewidth.  ...  The usual notion of treewidth for hypergraphs arises as the triangulation functor of a similar category of hypergraphs.  ...  A graph where every pair of distinct vertices is connected by an edge. 2 A graph where all cycles of > 3 vertices have a chord, i.e. an edge connecting non-adjacent vertices of the cycle.  ... 
arXiv:2105.05372v1 fatcat:awo7ddodzralhdbgk2bvjnkcli

Forgetting Auxiliary Atoms in Forks (Extended Abstract)

Felicidad Aguado, Pedro Cabalar, Jorge Fandinno, David Pearce, Gilberto Pérez, Concepción Vidal
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We provide a semantic characterisation of PSE for forks and use it to show that, in this extension, it is always possible to forget auxiliary atoms under strong persistence.  ...  In this paper, we introduce a conservative extension of Equilibrium Logic and its monotonic basis, the logic of Here-and-There, in which we deal with a new connective we call fork.  ...  Note that when k and ε are constants, then the running time of this algorithm becomes O(mn), i.e. the algorithm runs in time linear in the size of the m × n input matrix A.  ... 
doi:10.24963/ijcai.2020/685 dblp:conf/ijcai/Miettinen020 fatcat:ksb2lejf35ggtk3otqjn7xivke

Temporally coherent conservative visibility (extended abstract)

Satyan Coorg, Seth Teller
1996 Proceedings of the twelfth annual symposium on Computational geometry - SCG '96  
In essence, the algorithm implicitly constructs and maintains a linearized portion of an aspect graph, a data structure for representing visual events.  ...  As the synthetic viewpoint moves, the algorithm reuses visibility information computed for previous viewpoints.  ...  Also, thanks to Nina Amenta, Tom Funkhouser, Doug Voorhies, and the anonymous referees for their useful comments, and to Prof. Arvind for his continuing support.  ... 
doi:10.1145/237218.237242 dblp:conf/compgeom/CoorgT96 fatcat:75q7xi7spnatjioxyx6642rtk4

The complexity of multiway cuts (extended abstract)

E. Dahlhaus, D. S. Johnson, C. H. Papadimitriou, P. D. Seymour, M. Yannakakis
1992 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92  
We show that the problem becomes NP-hsrd as sxrn as k = 3, but ctm be solved in polynomial time for planar graphs for any fixed k. The planar problem is NP-hsrd however, if k is not tixad.  ...  . when the number k of terminals is two, this is simply the min-cu~msx-flow problem, and can be solved in polynomial time.  ...  in our original abstract, that for trees and 2-rrees, the general k-Way Cut problem can be solved in linear time by a straightforward dynamic programming algorithm.  ... 
doi:10.1145/129712.129736 dblp:conf/stoc/DahlhausJPSY92 fatcat:2p3wuh7r4nb4tlvgctbywfmsuu

Monotonicity in Bargaining Networks: (extended abstract) [chapter]

Yossi Azar, Nikhil R. Devanur, Kamal Jain, Yuval Rabani
2010 Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms  
Our proofs are based on a primal-dual argument (for the nucleolus) and on the FKG inequality (for the core center and the core median).  ...  On the other hand, the nucleolus is easy to compute, whereas computing the core center or the core median is #P-hard (yet it can be approximated in polynomial time).  ...  We call that time the freezing time of x. Theorem 12. The primal-dual algorithm computes the Lex-Center projected on U . That is d(v) = x(v) for all v ∈ U . Proof.  ... 
doi:10.1137/1.9781611973075.67 dblp:conf/soda/AzarDJR10 fatcat:4bw57ddn5fg6bnudnitkwxjinm

Indexing moving points (extended abstract)

Pankaj K. Agarwal, Lars Arge, Jeff Erickson
2000 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems - PODS '00  
We propose three indexing schemes for storing a set S of N points in the plane, each moving along a linear trajectory, so that a query of the following form can be answered quickly: Given a rectangle R  ...  We rst present an indexing structure that, for any given constant " > 0, uses O(N=B) disk blocks, where B is the block size, and answers a query in O((N=B) 1=2+" +K=B) I/Os.  ...  Omitting the analysis from this extended abstract, we conclude: Theorem 4.6.  ... 
doi:10.1145/335168.335220 dblp:conf/pods/AgarwalAE00 fatcat:g7cmr7zn7vbspokk4gx37gr3fe

GUBS Upper Bound Solver (Extended Abstract)

Martin Avanzini, Michael Schaper
2017 Electronic Proceedings in Theoretical Computer Science  
In this extended abstract we present the GUBS Upper Bound Solver.  ...  GUBS now forms the backbone of HoSA, a tool for analysing space and time complexity of higher-order functional programs automatically.  ...  We expect however an increase in strength and execution time due to the incorporation of GUBS in T C T.  ... 
doi:10.4204/eptcs.248.6 fatcat:jfdsl4gdqnbcvg64oboggem5wq

Online minimization of transition systems (extended abstract)

David Lee, Mihalis Yannakakis
1992 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing - STOC '92  
We specialize the method to obtain efficient algorithms for extended finite state machines that apply separable affine transformations on the variables.  ...  We present an algorithm for this problem that applies to general systems, provided we have appropriate primitive operations for manipulating blocks of states and we can determine termination; the number  ...  We sketch below the basic ideas for the linear time semi-stability algorithm for the one variable case.  ... 
doi:10.1145/129712.129738 dblp:conf/stoc/LeeY92 fatcat:kjmc5tczj5fxleqbybf5wyzzam

Improved algorithms for approximate string matching (extended abstract)

Dimitris Papamichail, Georgios Papamichail
2009 BMC Bioinformatics  
This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem.  ...  Results: We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s -|n -m|)·min(m, n, s) + m + n) and linear space, where  ...  Landau for information provided regarding the complexity of the edit distance problem, and Victor Milenkovic for his useful input in writing this manuscript.  ... 
doi:10.1186/1471-2105-10-s1-s10 pmid:19208109 pmcid:PMC2648743 fatcat:sgyfhzeyqba3piu47x5usics6u

Improved Algorithms for Approximate String Matching (Extended Abstract) [article]

Dimitris Papamichail, Georgios Papamichail
2008 arXiv   pre-print
This worst-case time bound sets the quadratic factor of the algorithm independent of the longest string length and improves existing theoretical bounds for this problem.  ...  We designed an output sensitive algorithm solving the edit distance problem between two strings of lengths n and m respectively in time O((s-|n-m|)min(m,n,s)+m+n) and linear space, where s is the edit  ...  Landau for information provided regarding the complexity of the edit distance problem.  ... 
arXiv:0807.4368v1 fatcat:oejk3nourfbafggmosvxww55qe

A Formalization and Proof of the Extended Church-Turing Thesis -Extended Abstract-

Nachum Dershowitz, Evgenia Falkovich
2012 Electronic Proceedings in Theoretical Computer Science  
We prove the Extended Church-Turing Thesis: Every effective algorithm can be efficiently simulated by a Turing machine.  ...  This is accomplished by emulating an effective algorithm via an abstract state machine, and simulating such an abstract state machine by a random access machine, representing data as a minimal term graph  ...  We demonstrate the validity of this thesis for all (sequential, deterministic, non-interactive) effective models over arbitrary constructive domains in the following manner: 1.  ... 
doi:10.4204/eptcs.88.6 fatcat:2gzuaxlo7jf6nlqwgudb5nuvna

Optimal parallel dictionary matching and compression (extended abstract)

Martin Farach, S. Muthukrishnan
1995 Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures - SPAA '95  
Parallel Dictionary Matching and Compression (Extended Abstract)  ...  Within two years of the dis- covery of the classical linear time string matching algo- rithm due to Knuth, Morris and Pratt [19], Aho and Corasick [3] designed a linear time (hence, optimal  ...  For each i, let L[i] = min{j[fif'[j] > i}. Then, (z, y) c Ed if L[y] = z. So can be computed in constant time and linear work.  ... 
doi:10.1145/215399.215451 dblp:conf/spaa/FarachM95 fatcat:5xlpmwfmsbay7et6iqdshogly4
« Previous Showing results 1 — 15 out of 133,768 results