2430 search results - page 77 / 486 » Computing Tutte Polynomials |
98
Voted
FOSSACS
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. Logics that can reason about sets and their cardinality bounds are useful in program analysis, program verification, databases, and knowledge bases. This paper presents ...
112
click to vote
ISSAC
2004
Springer
15 years 8 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...
123
click to vote
MFCS
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections...
127
Voted
DCC
2011
IEEE
14 years 9 months ago
2011
IEEE
Using the structure of Singer cycles in general linear groups, we prove that a conjecture of Zeng, Han and He (2007) holds in the affirmative in a special case, and outline a plaus...
109
Voted
AAIM
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We derive a polynomial time algorithm to compute a stable solution in a mixed matching market from an auction procedure as presented by Eriksson and Karlander [5]. As a s...