Result page:
1
2
3
4
5
6
7
8
9
10
>>
1
July 2016
EuroPlop '16: Proceedings of the 21st European Conference on Pattern Languages of Programs
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0, Downloads (12 Months): 20, Downloads (Overall): 20
Full text available:
PDF
The search for prime numbers is, unarguably, one of the most important problems in computational number theory. In addition to its intrinsic theoretical interest, research on the subject has been spurred by the compelling need for security in the digital world. A collection of patterns which aims at solving the ...
Keywords:
prime generation algorithms
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
Full Text:
... withthe notion and use of patterns.CCS Concepts: ?Theory of computation? Computational complexity and cryptography; ;Additional Key Words and Phrases: Prime generation algorithmsACM Reference Format:Teresa ...
2
February 2016
ACM Transactions on Computation Theory (TOCT): Volume 8 Issue 1, February 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3, Downloads (12 Months): 64, Downloads (Overall): 78
Full text available:
PDF
Obtaining a nontrivial (superlinear) lower bound for computation of the Fourier transform in the linear circuit model has been a long-standing open problem for more than 40 years. An early result by Morgenstern from 1973, provides an Ω( n log n ) lower bound for the unnormalized Fourier transform when ...
Keywords:
lower bounds, Fourier transform
CCS:
Computational complexity and cryptography
Full Text:
... invertible matrix, using ?quasi-entropy? of ?quasi-probabilities.?CCS Concepts: ? Theory of computation?Computational complexity and cryptography; ;Additional Key Words and Phrases: Fourier transform, lower boundsACM Reference ...
3
April 2017
ACM Transactions on Computation Theory (TOCT): Volume 9 Issue 2, May 2017
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 24, Downloads (12 Months): 24, Downloads (Overall): 24
Full text available:
PDF
A red-blue graph is a graph where every edge is colored either red or blue. The exact perfect matching problem asks for a perfect matching in a red-blue graph that has exactly a given number of red edges. We show that for complete and bipartite complete graphs, the exact perfect ...
Keywords:
Perfect matching, computational complexity, exact perfect matching, complete graphs
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
Full Text:
... in extending theresult to arbitrary graphs.CCS Concepts: ? Theory of computation?Computational complexity and cryptography; ;Additional Key Words and Phrases: Perfect matching, exact perfect matching, ...
4
July 2016
ACM Transactions on Computation Theory (TOCT): Volume 8 Issue 4, July 2016
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 3, Downloads (12 Months): 50, Downloads (Overall): 50
Full text available:
PDF
To reduce a graph problem to its planar version, a standard technique is to replace crossings in a drawing of the input graph by planarizing gadgets. We show unconditionally that such a reduction is not possible for the perfect matching problem and also extend this to some other problems related ...
Keywords:
planar graphs, Parallel complexity, perfect matching
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
5
June 2015
CCC '15: Proceedings of the 30th Conference on Computational Complexity
Publisher: Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik
This paper gives the first correlation bounds under product distributions, including the uniform distribution, against the class mNC 1 of polynomial-size O (log n )-depth monotone circuits. Our main theorem, proved using the pathset complexity framework introduced in [56], shows that the average-case k -CYCLE problem (on Erdős-Rényi random graphs ...
Keywords:
circuit complexity, average-case complexity
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
6
August 2007
IWCMC '07: Proceedings of the 2007 international conference on Wireless communications and mobile computing
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1, Downloads (12 Months): 4, Downloads (Overall): 167
Full text available:
PDF
The code division multiple access (CDMA) system capacity is limited by the amount of interference of the system. To reduce the unnecessary interference, this paper proposes optimized cell identification (ID) codes for site selection diversity transmission (SSDT) power control in wideband code division multiple access system of third generation partnership ...
Keywords:
FHT, cell ID, CDMA, SSDT
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
7
January 1985
Journal of the ACM (JACM): Volume 32 Issue 1, Jan. 1985
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1, Downloads (12 Months): 6, Downloads (Overall): 390
Full text available:
PDF
Nancy Lynch proved that if a decision problem A is not solvable in polynomial time, then there exists an infinite recursive subset X of its domain on which the decision is almost everywhere complex. In this paper, general theorems of this kind that can be applied to several well-known automata-based ...
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
8
December 2014
Journal of the ACM (JACM): Volume 61 Issue 6, November 2014
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 1, Downloads (12 Months): 22, Downloads (Overall): 204
Full text available:
PDF
We study the set disjointness problem in the most powerful model of bounded-error communication, the k -party randomized number-on-the-forehead model. We show that set disjointness requires Ω(√n/2 k k ) bits of communication, where n is the size of the universe. Our lower bound generalizes to quantum communication, where it ...
Keywords:
multiparty communication complexity, quantum communication complexity, polynomial approximation, Set disjointness problem, directional derivatives
CCS:
Computational complexity and cryptography
9
August 2007
ICEC '07: Proceedings of the ninth international conference on Electronic commerce
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 4, Downloads (Overall): 190
Full text available:
PDF
The use of trading agents to manage the allocation and bundling of resources across computer networks is well established and literature to date has focused on a variety of auction and distributed market type mechanisms that use economic principles to determine the "best" allocation. An empirical analysis of a number ...
Keywords:
grid, allocation, combinatorial auctions, distributed market performance, trading agents, quote driven market, resource
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
10
July 2010
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2, Downloads (12 Months): 7, Downloads (Overall): 83
Full text available:
PDF
We demonstrate how to leverage a system's capability for all-to-all communication to achieve an exponential speed-up of local algorithms despite bandwidth and memory restrictions. More precisely, if a network comprises n nodes with all-to-all bandwidth n ε (ε > 0 constant) and nodes know their input and neighborhood with respect ...
Keywords:
simulation, local algorithms, all-to-all communication
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
11
May 1971
STOC '71: Proceedings of the third annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 2, Downloads (12 Months): 8, Downloads (Overall): 288
Full text available:
PDF
A classification of all the computable functions is given in terms of subrecursive programming languages. These classes are those which also arise from the relation “primitive recursive in.” By distinguishing between honest and dishonest classes the classification is related to the computational complexity of the functions classified, and the classification ...
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
12
May 2016
AsiaPKC '16: Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 27, Downloads (12 Months): 88, Downloads (Overall): 103
Full text available:
PDF
We present a method for key compression in quantumresistant isogeny-based cryptosystems, which allows a reduction in and transmission costs of per-party public information by a factor of two, with no e ect on security. We achieve this reduction by associating a canonical choice of elliptic curve to each j-invariant, and ...
Keywords:
key compression, isogenies, elliptic curves, post-quantum cryptography
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
13
February 2016
FPGA '16: Proceedings of the 2016 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 8, Downloads (12 Months): 75, Downloads (Overall): 128
Full text available:
PDF
We propose a method to automatically derive hardware structures that perform a fixed linear permutation on streaming data. Linear permutations are permutations that map linearly the bit representation of the elements addresses. This set contains many of the most important permutations in media processing, communication, and other applications and includes ...
Keywords:
data reordering, matrix transposition, streaming datapath, matrix factorization, connection network, stride permutation, bit-reversal
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
14
July 1992
COLT '92: Proceedings of the fifth annual workshop on Computational learning theory
Publisher: ACM
Bibliometrics:
Citation Count: 3
Downloads (6 Weeks): 1, Downloads (12 Months): 3, Downloads (Overall): 135
Full text available:
PDF
We study the on-line learning of classes of functions of a single real variable formed through bounds on various norms of functions' derivatives. We determine the best bounds obtainable on the worst-case sum of squared errors (also “absolute” errors) for several such classes.
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
15
July 1996
STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 12
Downloads (6 Weeks): 1, Downloads (12 Months): 3, Downloads (Overall): 203
Full text available:
PDF
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
16
July 2010
PODC '10: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1, Downloads (12 Months): 7, Downloads (Overall): 112
Full text available:
PDF
We quantify the effect of Bayesian ignorance by comparing the social cost obtained in a Bayesian game by agents with local views to the expected social cost of agents having global views. Both benevolent agents, whose goal is to minimize the social cost, and selfish agents, aiming at minimizing their ...
Keywords:
bayesian games, network cost sharing, local vs. global view
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
17
June 2010
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 56
Downloads (6 Weeks): 2, Downloads (12 Months): 13, Downloads (Overall): 344
Full text available:
PDF
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computationally unbounded but does not know any part of x; their goal is to cooperatively decide whether x belongs to L at small ...
Keywords:
feedback vertex set, parameterized complexity, probabilistically checkable proofs, vertex cover, vertex deletion problems, arithmetic progression free sets, hereditary graph properties, sparsification, kernelization, satisfiability
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
18
June 2010
STOC '10: Proceedings of the forty-second ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 11
Downloads (6 Weeks): 1, Downloads (12 Months): 15, Downloads (Overall): 307
Full text available:
PDF
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a parallelized form of the matrix multiplicative weights update method to a class of semidefinite programs that captures the computational power of quantum ...
Keywords:
quantum computation, semidefinite programming, matrix multiplicative weights update method, quantum interactive proof systems
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
19
October 2016
CCS '16: Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 28, Downloads (12 Months): 277, Downloads (Overall): 277
Full text available:
PDF
In the setting of secure multiparty computation, a set of parties with private inputs wish to compute some function of their inputs without revealing anything but their output. Over the last decade, the efficiency of secure two-party computation has advanced in leaps and bounds, with speedups of some orders of ...
Keywords:
secure multiparty computation, concrete efficiency, cryptography, garbled circuits
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
20
May 2012
STOC '12: Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Publisher: ACM
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 2, Downloads (12 Months): 6, Downloads (Overall): 165
Full text available:
PDF
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be computationally equivalent to two basic tools in linear algebra: iterated matrix multiplication and the determinant. We compare the computational power of ...
Keywords:
arithmetic circuits, multilinear computations, algebraic branching programs, arithmetic formulas, polynomials
CCS:
Computational complexity and cryptography
Primary CCS:
Computational complexity and cryptography
Result page:
1
2
3
4
5
6
7
8
9
10
>>
