The following pages link to Pavel Pudlák (Q185618):
Displaying 50 items.
- A note on the use of determinant for proving lower bounds on the size of linear circuits (Q294768) (← links)
- A lower bound on the size of resolution proofs of the Ramsey theorem (Q436623) (← links)
- On shifting networks (Q685361) (← links)
- Cycles of nonzero elements in low rank matrices (Q700384) (← links)
- Alternating minima and maxima, Nash equilibria and bounded arithmetic (Q764279) (← links)
- Regraphs and congruence lattices (Q794676) (← links)
- On the complexity of finding falsifying assignments for Herbrand disjunctions (Q892133) (← links)
- Linear tree codes and the problem of explicit constructions (Q898793) (← links)
- Lower bounds to the complexity of symmetric Boolean functions (Q914382) (← links)
- (Q964404) (redirect page) (← links)
- On convex complexity measures (Q964405) (← links)
- Some constructive bounds on Ramsey numbers (Q974470) (← links)
- Quantum deduction rules (Q1001909) (← links)
- Solving the \$100 modal logic challenge (Q1006738) (← links)
- A note on monotone complexity and the rank of matrices (Q1014450) (← links)
- The number of proof lines and the size of proofs in first order logic (Q1102280) (← links)
- On the structure of initial segments of models of arithmetic (Q1123890) (← links)
- Every finite lattice can be embedded in a finite partition lattice (Q1139064) (← links)
- Partition theorems for systems of finite subsets of integers (Q1164628) (← links)
- Bounded arithmetic and the polynomial hierarchy (Q1177041) (← links)
- A combinatorial approach to complexity (Q1196691) (← links)
- Distributivity of strongly representable lattices (Q1239176) (← links)
- A new proof of the congruence lattice representation theorem (Q1239185) (← links)
- Congruence lattices of finite algebras and intervals in subgroup lattices of finite groups (Q1249590) (← links)
- Complexity in mechanized hypothesis formation (Q1256867) (← links)
- On the computational power of depth-2 circuits with threshold and modulo gates (Q1269909) (← links)
- Computing Boolean functions by polynomials and threshold circuits (Q1293360) (← links)
- A note on applicability of the incompleteness theorem to human mind (Q1295425) (← links)
- Superconcentrators of depths 2 and 3; odd levels help (rarely) (Q1318476) (← links)
- Communication in bounded depth circuits (Q1330798) (← links)
- Some combinatorial-algebraic problems from complexity theory (Q1344621) (← links)
- On sparse parity check matrices (Q1368732) (← links)
- Proof complexity in algebraic systems and bounded depth Frege systems with modular counting (Q1377580) (← links)
- Some consequences of cryptographical conjectures for \(S_2^1\) and EF (Q1383164) (← links)
- On reducibility and symmetry of disjoint NP pairs. (Q1401249) (← links)
- Equilateral sets in \(l_p^n\) (Q1403361) (← links)
- A note on monotone real circuits (Q1685020) (← links)
- The complexity of proving that a graph is Ramsey (Q1705815) (← links)
- Graph complexity (Q1823693) (← links)
- Complexity theory and genetics: The computational power of crossing over (Q1854479) (← links)
- Monotone simulations of non-monotone proofs. (Q1872729) (← links)
- Top-down lower bounds for depth-three circuits (Q1904663) (← links)
- Lower bounds for the polynomial calculus and the Gröbner basis algorithm (Q1961057) (← links)
- Some structural properties of low-rank matrices related to computational complexity (Q1978702) (← links)
- Classification of 9-dimensional trilinear alternating forms over \(\mathrm{GF}(2)\) (Q1995217) (← links)
- On matrices potentially useful for tree codes (Q2059875) (← links)
- Extractors for small zero-fixing sources (Q2095117) (← links)
- Santha-Vazirani sources, deterministic condensers and very strong extractors (Q2195575) (← links)
- The canonical pairs of bounded depth Frege systems (Q2216035) (← links)
- Random resolution refutations (Q2311546) (← links)
