Sciweavers

876 search results - page 51 / 176
» New Results for the Martin Polynomial
Sort
View
SMC
2007
IEEE
146views Control Systems» more  SMC 2007»
14 years 3 months ago
Blender plugin implementations for 3D collaborative work
— The development of networking and client/server systems over the Internet had led to many collaborative work software applications. To extend the graphic design collaborative p...
Martin Lesage, Omar Cherkaoui, Faysal Abouzaid, Ma...
ECCC
2007
122views more  ECCC 2007»
13 years 8 months ago
Infeasibility of Instance Compression and Succinct PCPs for NP
The OR-SAT problem asks, given Boolean formulae φ1, . . . , φm each of size at most n, whether at least one of the φi’s is satisfiable. We show that there is no reduction fr...
Lance Fortnow, Rahul Santhanam
EUROCRYPT
2012
Springer
11 years 11 months ago
Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
Abstract. The goal of this paper is to further study the index calculus method that was first introduced by Semaev for solving the ECDLP and later developed by Gaudry and Diem. In...
Jean-Charles Faugère, Ludovic Perret, Chris...
EPIA
2005
Springer
14 years 2 months ago
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
The paper studies reductions of propositional theories in equilibrium logic to logic programs under answer set semantics. Specifically we are concerned with the question of how to...
Pedro Cabalar, David Pearce, Agustín Valver...
ICALP
2005
Springer
14 years 2 months ago
The Tree Inclusion Problem: In Optimal Space and Faster
Given two rooted, ordered, and labeled trees P and T the tree inclusion problem is to determine if P can be obtained from T by deleting nodes in T. This problem has recently been r...
Philip Bille, Inge Li Gørtz