Sciweavers

3228 search results - page 154 / 646
» Computationally Sound Proofs
Sort
View
EOR
2008
75views more  EOR 2008»
15 years 6 months ago
Soft car sequencing with colors: Lower bounds and optimality proofs
This paper is a study of the car sequencing problem, when feature spacing constraints are soft and colors of vehicles are taken into account. Both pseudo-polynomial algorithms and ...
Thierry Benoist
WINE
2010
Springer
148views Economy» more  WINE 2010»
15 years 4 months ago
False-Name-Proofness in Social Networks
In mechanism design, the goal is to create rules for making a decision based on the preferences of multiple parties (agents), while taking into account that agents may behave stra...
Vincent Conitzer, Nicole Immorlica, Joshua Letchfo...
CORR
2008
Springer
97views Education» more  CORR 2008»
15 years 6 months ago
Lower bounds for adaptive linearity tests
Linearity tests are randomized algorithms which have oracle access to the truth table of some function f, and are supposed to distinguish between linear functions and functions whi...
Shachar Lovett
ECCC
2007
90views more  ECCC 2007»
15 years 6 months ago
Parameterized Proof Complexity: a Complexity Gap for Parameterized Tree-like Resolution
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixed-parameter tractable. We consider proofs that witness that a given pro...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CSL
2007
Springer
16 years 20 days ago
Proofs, Programs and Abstract Complexity
Programs and Abstract Complexity A. Beckmann University of Wales Swansea Swansea, UK Axiom systems are ubiquitous in mathematical logic, one famous and well studied example being ...
Arnold Beckmann