42,710 Hits in 7.0 sec

GCD of Many Integers (Extended Abstract) [chapter]

Gene Cooperman, Sandra Feisel, Joachim von zur Gathen, George Havas
1999 Lecture Notes in Computer Science  
Acknowledgements We are grateful to Mark Giesbrecht, Boaz Patt-Shamir and Igor Shparlinski for helpful discussions.  ...  This iterative computation of pairwise gcds will work well for random inputs, but there are "nasty" inputs on which this method will need m − 1 pairwise gcd computations.  ...  Due to Fact 1 we cannot expect this probability to be as high as in the polynomial case, but tests show that this strategy seems to have roughly the expected success probability of 6/π 2 .  ... 
doi:10.1007/3-540-48686-0_31 fatcat:dcyl7meamffe5mnhzz7a5fky5y

Fuzzy Private Matching (Extended Abstract)

Lukasz Chmielewski, Jaap-Henk Hoepman
2008 2008 Third International Conference on Availability, Reliability and Security  
The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all.  ...  In certain applications it would be useful to have a fuzzy private matching protocol that reports a match even if two elements are only similar instead of equal.  ...  Generic multi-party computation and oblivious transfer are considered not to be efficient techniques.  ... 
doi:10.1109/ares.2008.170 dblp:conf/IEEEares/ChmielewskiH08 fatcat:of2ofpydrve23j5pdgd2wo5g7y

Fuzzy Private Matching (Extended Abstract) [article]

Łukasz Chmielewski, Jaap-Henk Hoepman
2007 arXiv   pre-print
The client wants to privately compute the intersection of these two sets: he learns which elements he has in common with the server (and nothing more), while the server gains no information at all.  ...  In certain applications it would be useful to have a private matching protocol that reports a match even if two elements are only similar instead of equal.  ...  In fact, the roots of the polynomial P σ are σ(X i ) It is easy to see that if X ≈ t Y then σ(X) = σ(Y ) for some combination σ.  ... 
arXiv:0710.5425v1 fatcat:dkblydoa7venppbfw6jgyzyyp4

On Problems without Polynomial Kernels (Extended Abstract) [chapter]

Hans L. Bodlaender, Rodney G. Downey, Michael R. Fellows, Danny Hermelin
2008 Lecture Notes in Computer Science  
In this paper, we introduce a new method which allows us to show that many problems do not have polynomial size kernels under reasonable complexity-theoretic assumptions.  ...  These problems include k- Path, k-Cycle, k-Exact Cycle, k-Short Cheap Tour, k-Graph Minor Order Test, k-Cutwidth, k-Search Number, k-Pathwidth, k-Treewidth, k-Branchwidth, and several optimization problems  ...  Acknowledgements We would like to thank Lance Fortnow, Raul Santhanam, and Harry Buhrman for many fruitful discussions. In particular, Lance and Raul provided the proof for Lemma 2 of this paper.  ... 
doi:10.1007/978-3-540-70575-8_46 fatcat:sd3fuidkzvay7hvljo257xpvjy

Exact learning via teaching assistants (Extended abstract) [chapter]

V. Arvind, N. V. Vinodchandran
1997 Lecture Notes in Computer Science  
We generalize the notion of teaching dimension 9] and de ne a notion of weak teaching dimension using which we characterize concept classes that are learnable with NP \ co-NP assistants.  ...  The new ingredient is that apart from the learner and teacher there is a third agent called teaching assistant which acts as an intermediary between the learner and teacher.  ...  It is easy to see that for those representation classes P which has representations in size polynomial in n for concepts in P n , weak polynomial teaching dimension and polynomial teaching dimension are  ... 
doi:10.1007/3-540-63577-7_50 fatcat:l3pyey5rt5ac3jdnntarmljeem

Symbolic mathematics system evaluators (extended abstract)

Richard J. Fateman
1996 Proceedings of the 1996 international symposium on Symbolic and algebraic computation - ISSAC '96  
Evaluation" of expressions and programs in a computer algebra system is central to every system, but inevitably fails to provide complete satisfaction.  ...  It may of course result in wasting time when a symbolic result is easy to compute and then evaluate numerically.  ...  Thus, divide(a,x+1,'q') might test to see if x+1 divides exactly into the polynomial denoted by a. If so, q is assigned the quotient.  ... 
doi:10.1145/236869.236907 dblp:conf/issac/Fateman96 fatcat:bzwdnup5ifh6jjgzcfpsyffy5y

Variable Elimination in Binary CSPs (Extended Abstract)

Martin C. Cooper, Achref El Mouelhi, Cyril Terrioux
2020 Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence  
We investigate rules which allow variable elimination in binary CSP (constraint satisfaction problem) instances while conserving satisfiability.  ...  We give optimised algorithms to apply these rules and show that each defines a novel tractable class.  ...  Computers also make it easy to generate synthetic data on which to test fair division mechanisms.  ... 
doi:10.24963/ijcai.2020/691 dblp:conf/ijcai/Walsh20 fatcat:i4h3p6o2tvcl7iu4ah33hk2nr4

How to break Gifford's cipher (extended abstract)

Thomas R. Cain, Alan T. Sherman
1994 Proceedings of the 2nd ACM Conference on Computer and communications security - CCS '94  
We present. and implement a ,ciphertext-only algorithm to break Gifford's cipher, a stream cipher designed in 1984 by David Gifford of MIT and used to encrypt New York Times and Associated Press wire reports  ...  Applying linear algebra over finite fields, we exploit a time-space tradeoff to separately determine key segments derived from a decomposition of the feedback function.  ...  All computer work was carried out on workstations at the University of Maryland Baltimore County.  ... 
doi:10.1145/191177.191227 dblp:conf/ccs/CainS94 fatcat:lcpp32olazdjnl4av62jxxvo2i

Efficient Decomposition of Bimatrix Games (Extended Abstract)

Xiang Jiang, Arno Pauly
2014 Electronic Proceedings in Theoretical Computer Science  
An implementation of the algorithm is shown to yield a significant performance increase on inputs with small parameters.  ...  Acknowledgements We are grateful for various helpful comments from referees. One comment in particular was instrumental in improving the runtime analysis of our algorithm to a quadratic exponent.  ...  We point out that [ , ] is polynomial-time computable and polynomial-time invertible. Definition 1.  ... 
doi:10.4204/eptcs.146.10 fatcat:iy6bjjsmmjgj7hdtqjgahd65pm

Time-complexity semantics for feasible affine recursions (extended abstract) [article]

Norman Danner, James S. Royer
2007 arXiv   pre-print
ATR programs run in type-2 polynomial-time and all standard type-2 basic feasible functionals are ATR-definable (ATR types are confined to levels 0, 1, and 2).  ...  Here we extend ATR so that a broad range of affine recursions are directly expressible.  ...  (an extension of polynomial-time computability to type-2) of Mehlhorn [12] and Cook and Urquhart [4] are ATR definable.  ... 
arXiv:cs/0701076v2 fatcat:zvc3qmbf2zeo3floespuh2feuq

Upward planarity testing of outerplanar dags (extended abstract) [chapter]

Achilleas Papakostas
1995 Lecture Notes in Computer Science  
This is the first polynomial-time algorithm we know of to solve this problem.  ...  In this paper, we present two polynomial-time algorithms to determine if an outerplanar directed acyclic graph (odag) can be drawn upward planar, that is, drawn in planar straight-line fashion so that  ...  Acknowledgements The author wishes to thank Seth Malitz for a variety of helpful discussions and especiMly for his comments on earlier drafts of the paper.  ... 
doi:10.1007/3-540-58950-3_385 fatcat:awx5kmsp2fagxnyophggww56em

Rationalisation of Profiles of Abstract Argumentation Frameworks: Extended Abstract

Stephane Airiau, Elise Bonzon, Ulle Endriss, Nicolas Maudet, Julien Rossit
2017 Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence  
We review a recently introduced model in which each of a number of agents is endowed with an abstract argumentation framework reflecting her individual views regarding a given set of arguments.  ...  This is useful for understanding what types of profiles can reasonably be expected to occur in a multiagent system.  ...  Acknowledgements We are grateful for the feedback received from several anonymous reviewers.  ... 
doi:10.24963/ijcai.2017/665 dblp:conf/ijcai/AiriauBEMR17 fatcat:2cyxwyxlhrdvvgfmjhgixn5qaq

Algebras for querying text regions (extended abstract)

Mariano P. Consens, Tova Milo
1995 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '95  
It is easy to see that direct inclusion and both-included can be expressed by this extended language.  ...  But, since e computes C BI (B, A) then rzk+l 6 e(~), while rzk+l @ e(l'), which yields a contradiction. Thus all we have to show is that 1' is a k- reduced version on 1.  ... 
doi:10.1145/212433.212437 dblp:conf/pods/ConsensM95 fatcat:25ishthhy5hahodlqp2qjv4cmy

The complexity of relational query languages (Extended Abstract)

Moshe Y. Vardi
1982 Proceedings of the fourteenth annual ACM symposium on Theory of computing - STOC '82  
Two complexity measures for query languages are proposed.  ...  The pattern which will bc shown is that the expression complexity of the investigated languages is one exponential higher then their data complexity, and for both types of complexity we show completeness  ...  I'd like also to thank Ashok Chandra for his insightful remarks, in particular for pointing out that changing the syntax of the language can change its expression complexity. 1'hanks are also d:le to Nick  ... 
doi:10.1145/800070.802186 dblp:conf/stoc/Vardi82 fatcat:4cdrq5vgajbf5ptlzg445345lu

Interactive proofs for BQP via self-tested graph states (extended abstract) [article]

Matthew McKague
2013 arXiv   pre-print
In this extended abstract we give an overview of the construction and proofs.  ...  Our techniques use self-tested graph states which allow us to test the provers for honesty, establishing that they hold onto a particular graph state and measure it in specified bases.  ...  Acknowledgements -Thanks to Serge Massar, Stefano Pironio, Iordanis Kerenidis, Frédéric Magniez, David Hutchinson and Michael Albert for helpful discussions.  ... 
arXiv:1311.1534v1 fatcat:p26svrv7hfd5zpu5luuxn5z57a
« Previous Showing results 1 — 15 out of 42,710 results