Sciweavers

1054 search results - page 72 / 211
» Determining Computing Science's Role
Sort
View
STACS
2007
Springer
15 years 6 months ago
A New Rank Technique for Formula Size Lower Bounds
We exactly determine the formula size of the parity function. If n = 2 + k, where 0 ≤ k < 2 , then the formula size of parity on n bits is 2 (2 + 3k) = n2 + k2 − k2 . Khrap...
Troy Lee
TLCA
2007
Springer
15 years 6 months ago
Polynomial Size Analysis of First-Order Functions
We present a size-aware type system for first-order shapely function definitions. Here, a function definition is called shapely when the size of the result is determined exactly...
Olha Shkaravska, Ron van Kesteren, Marko C. J. D. ...
ACSC
2006
IEEE
15 years 6 months ago
Identifying refactoring opportunities by identifying dependency cycles
The purpose of refactoring is to improve the quality of a software system by changing its internal design so that it is easier to understand or modify, or less prone to errors and...
Hayden Melton, Ewan D. Tempero
WG
2004
Springer
15 years 5 months ago
Decremental Clique Problem
The clique problem consists in determining whether an undirected graph G of order n contains a clique of order . In this paper we are concerned with the decremental version of cliq...
Fabrizio Grandoni, Giuseppe F. Italiano
FOCS
2002
IEEE
15 years 4 months ago
Auctions with Severely Bounded Communication
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
Liad Blumrosen, Noam Nisan