Sciweavers

Share
CC
2006
Springer
147views System Software» more  CC 2006»
9 years 11 months ago
Complexity of Ring Morphism Problems
Abstract. We study the complexity of the isomorphism and automorphism problems for finite rings. We show that both integer factorization and graph isomorphism reduce to the problem...
Neeraj Kayal, Nitin Saxena
CC
2006
Springer
101views System Software» more  CC 2006»
9 years 11 months ago
Inductive Time-Space Lower Bounds for Sat and Related Problems
We improve upon indirect diagonalization arguments for lower bounds on explicit problems within the polynomial hierarchy. Our contributions are summarized as follows.
Ryan Williams
CC
2006
Springer
108views System Software» more  CC 2006»
9 years 11 months ago
Languages to diagonalize against advice classes
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
Chris Pollett
CC
2006
Springer
133views System Software» more  CC 2006»
9 years 11 months ago
The complexity of chromatic strength and chromatic edge strength
The sum of a coloring is the sum of the colors assigned to the vertices (assuming that the colors are positive integers). The sum (G) of graph G is the smallest sum that can be ach...
Dániel Marx
CC
2006
Springer
123views System Software» more  CC 2006»
9 years 11 months ago
On the complexity of approximating k-set packing
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
Elad Hazan, Shmuel Safra, Oded Schwartz
CC
2006
Springer
125views System Software» more  CC 2006»
9 years 11 months ago
A tight lower bound for restricted pir protocols
We show that any 1-round 2-server Private Information Retrieval Protocol where the answers are 1-bit long must ask questions that are at least n - 2 bits long, which is nearly equa...
Richard Beigel, Lance Fortnow, William I. Gasarch
CC
2006
Springer
176views System Software» more  CC 2006»
10 years 1 months ago
The CGiS Compiler-A Tool Demonstration
The CGiS programming language is designed to open up the parallel performance possibilities of graphics processing units (GPUs) to general purpose programmers. This tool demonstrat...
Philipp Lucas, Nicolas Fritz, Reinhard Wilhelm
CC
2006
Springer
118views System Software» more  CC 2006»
10 years 3 months ago
Lightweight Lexical Closures for Legitimate Execution Stack Access
We propose a new language concept called "L-closures" for a running program to legitimately inspect/modify the contents of its execution stack. L-closures are lightweight...
Masahiro Yasugi, Tasuku Hiraishi, Taiichi Yuasa
CC
2006
Springer
108views System Software» more  CC 2006»
10 years 3 months ago
A Fresh Look at PRE as a Maximum Flow Problem
We show that classic PRE is also a maximum flow problem, thereby revealing the missing link between classic and speculative PRE, and more importantly, establishing a common high-le...
Jingling Xue, Jens Knoop
books