The following pages link to Marek Karpinski (Q396628):
Displaying 50 items.
- (Q198874) (redirect page) (← links)
- Optimal cuts and partitions in tree metrics in polynomial time (Q396629) (← links)
- Approximating vertex cover in dense hypergraphs (Q450531) (← links)
- Inapproximability of dominating set on power law graphs (Q476891) (← links)
- On the computational complexity of measuring global stability of banking networks (Q487019) (← links)
- Nearly tight approximation bounds for vertex cover on dense \(k\)-uniform \( k\)-partite hypergraphs (Q491613) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Polynomial bounds for VC dimension of sigmoidal and general Pfaffian neural networks (Q676431) (← links)
- Lower bound on testing membership to a polyhedron by algebraic decision and computation trees (Q677021) (← links)
- Counting curves and their projections (Q677992) (← links)
- Some computational problems in linear algebra as hard as matrix multiplication (Q685718) (← links)
- Optimal trade-off for Merkle tree traversal (Q870836) (← links)
- Computational complexity of some restricted instances of 3-SAT (Q875598) (← links)
- On the Monte Carlo space constructible functions and separation results for probabilistic complexity classes (Q1094874) (← links)
- Subtree isomorphism is NC reducible to bipartite perfect matching (Q1115630) (← links)
- Parallel construction of perfect matchings and Hamiltonian cycles on dense graphs (Q1116690) (← links)
- Decidability of ''Skolem matrix emptiness problem'' entails constructability of exact regular expression (Q1171048) (← links)
- On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields (Q1178687) (← links)
- Perfect matching for regular graphs is \(AC^ 0\)-hard for the general matching problem (Q1185245) (← links)
- An efficient parallel algorithm for computing a maximal independent set in a hypergraph of dimension 3 (Q1198086) (← links)
- On randomized semi-algebraic test complexity (Q1260656) (← links)
- Alphabet-independent optimal parallel search for three-dimensional patterns (Q1275083) (← links)
- An exponential lower bound on the size of algebraic decision trees for MAX (Q1277095) (← links)
- Compact cellular algebras and permutation groups (Q1292833) (← links)
- On a new high dimensional Weisfeiler-Lehman algorithm (Q1296386) (← links)
- Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems (Q1305935) (← links)
- An algorithm to learn read-once threshold formulas, and transformations between learning models (Q1327594) (← links)
- An efficient parallel algorithm for the minimal elimination ordering (MEO) of an arbitrary graph (Q1341730) (← links)
- On some approximation problems concerning sparse polynomials over finite fields (Q1351508) (← links)
- Computability of the additive complexity of algebraic circuits with root extracting (Q1351701) (← links)
- On randomized versus deterministic computation (Q1365675) (← links)
- New approximation algorithms for the Steiner tree problems (Q1383806) (← links)
- A lower bound for randomized algebraic decision trees (Q1386178) (← links)
- Randomization and the computational power of analytic and algebraic decision trees (Q1386179) (← links)
- Correctness of constructing optimal alphabetic trees revisited (Q1390875) (← links)
- Matching and multidimensional matching in chordal and strongly chordal graphs (Q1392565) (← links)
- A lower bound for integer multiplication on randomized ordered read-once branching programs. (Q1426006) (← links)
- Zero testing of \(p\)-adic and modular polynomials (Q1575936) (← links)
- A note on approximating Max-Bisection on regular graphs (Q1603473) (← links)
- Randomized splay trees: Theoretical and experimental results. (Q1603506) (← links)
- On the approximation hardness of dense TSP and other path problems (Q1606928) (← links)
- A QPTAS for the base of the number of crossing-free structures on a planar point set (Q1698728) (← links)
- Polynomial interpolation and identity testing from high powers over finite fields (Q1709581) (← links)
- Effect of Gromov-hyperbolicity parameter on cuts and expansions in graphs and some algorithmic implications (Q1709598) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
- Identity testing and interpolation from high powers of polynomials of large degree over finite fields (Q1791682) (← links)
- The interpolation problem for \(k\)-sparse sums of eigenfunctions of operators (Q1814141) (← links)
- Learning by the process of elimination (Q1854541) (← links)
- On the complexity of pattern matching for highly compressed two-dimensional texts. (Q1872708) (← links)
